Fig. 3.

An example of a directed graph generated by nearest neighbor associations. Here point 2 is a neighbor of point 1, point 3 is a neighbor of point 7, etc. In this case, the directed graph forms two strongly connected components: points 1, 2, 5, and points 3, 4, 6. In analyzing this data set, we would use LLE separately on each of these components and would remove point 7, which is not strongly connected to any other point