• Advertisement
Sign in to follow this  

distance b/w 2 nodes in undirected graph

This topic is 4107 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi, Is there any algorithm that finds the distance b/w 2 arbitrarily chosen nodes in an undirected graph. Please point me to such a resource. Thanks Bye

Share this post


Link to post
Share on other sites
Advertisement
You could start with BFS.
But for common game-related needs, where you want to look for a distance of two points on a map, A-star is usually a better choice.

Share this post


Link to post
Share on other sites
Breadth-first search if unweighted.
Dijkstra if weighted with no negative weights.
Bellman-Ford if weighted with negative weights.

All these search the minimum distance between a node and all other nodes, but you can stop them as soon as the distance to the second node is known.

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement