Thanks for your reply Aussiebear.

I don't want to make a "Google Maps" nor something to serious hehe. I just want to find the intersections points. I don't care about any of the things you said. Of course, it would be important for a serious project, as you said, but this is not the case, I just want to know if it's possible to find the connections points, no matter anything else.

Do you know any approaches thinking only in the information given in the first post? I mean, as an abstract way of getting an intersection (or as much as possible in a logical way) between two points in a list.

If there were only one intersection, I would just have to look for the waypoint that matches the start and the destination points, but there might be (as in the example of my first post), several "jumps" to reach the destination (and this is the theorical problem that I don't know how to solve ).

Any ideas??