<P> A very high - level description of Isomap algorithm is given below . </P> <Ul> <Li> Determine the neighbors of each point . <Ul> <Li> All points in some fixed radius . </Li> <Li> K nearest neighbors . </Li> </Ul> </Li> <Li> Construct a neighborhood graph . <Ul> <Li> Each point is connected to other if it is a K nearest neighbor . </Li> <Li> Edge length equal to Euclidean distance . </Li> </Ul> </Li> <Li> Compute shortest path between two nodes . <Ul> <Li> Dijkstra's algorithm </Li> <Li> Floyd--Warshall algorithm </Li> </Ul> </Li> <Li> Compute lower - dimensional embedding . <Ul> <Li> Multidimensional scaling </Li> </Ul> </Li> </Ul> <Li> Determine the neighbors of each point . <Ul> <Li> All points in some fixed radius . </Li> <Li> K nearest neighbors . </Li> </Ul> </Li> <Ul> <Li> All points in some fixed radius . </Li> <Li> K nearest neighbors . </Li> </Ul>

What is the first step of the isomap algorithm