Shortest Path in Graph
BFS searching shortest path
Well done! Now, let's implement a method that helps us to find the length of shortest path between two vertices, i. e. minimum number of edges to reach end vertice from start.
You should store the length of the way from start to curr node, and you can do it by modifying visited array: visited[i] equals:
-1, if
inot visited yet0, if
iis visited as first node1, if
iis a neighbor of node, that has mark0k, if
iis a neighbor of node with mark k-1 etc.
This way, you'll store the distance between start and current node, like at the example:
So, the answer is a visited[end].
Swipe to start coding
bfs(start, end) returns a number of edges between start and end nodes. If there is no path, return -1.
Actually this method does traverse as BFT method, but until the end vertex is found. Copy & Paste your BFT algorithm, and add some changes.
Byt till skrivbordet för praktisk övningFortsätt där du är med ett av alternativen nedanTack för dina kommentarer!
Byt till skrivbordet för praktisk övningFortsätt där du är med ett av alternativen nedan