There's an easy way to apply a shortest path alghoritm in objective c?

Question

I have a series of point (x,y) linked by a path. There's an easy way in objective c to apply something like a Dijkstra shortest path alghoritm in order to know the shortest path among two variable points of these? The real problem is i have an image with a series of locations on it and the coordinate of all these location. Now i need the user to choose two of this location and getting the shortest path between the location choosen.

Accepted Answer

I found a way to do this. Here there is a perfect implementation of the algorithm. Hope it helps someone.

https://github.com/snyderp/PESGraph

There's an easy way to apply a shortest path alghoritm in objective c?

Solution

Problem