Hi,
I'm using DijkstraShortestPathFinder to find optimal routing between two point on my graph. My source and destinations points may have be any point. The process is, I pick up a point, than compare aganist all the nodes to find nearest one. Than I use that node in the algorithm. Its successfully calculate the route. Everything works fine until i try to see path on the map. Because the path does not connect to actual source and destination points.

How can i connect my actual source and destination points to the path? Following image illustrates my problem.

http://www.nobesis.com/images/graph.gif

Best regards.