+ 1
I want to find shortest path from source to destination by visiting all the nodes in an undirected weighted graph.
I tried it by Dijkstra algorithm but it gives the shortest path from source to every node and also it doesn't visit all nodes.. Please help me with this.. It means a lot to me . Please help .
1 Odpowiedź
0
depth first search or have a look at A* algorithm.