Sign in to follow this  

distance b/w 2 nodes in undirected graph

This topic is 4035 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

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

This topic is 4035 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.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this