New course! Every coder should learn Generative AI!
Try a free lesson+ 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 Answer
0
depth first search or have a look at A* algorithm.
Often have questions like this?
Learn more efficiently, for free:
Hot today
Why output is 0 for from_chars
2 Votes
Cyber security
0 Votes
Personal chat
1 Votes
Bash
0 Votes
Why exception is not handled
1 Votes
Adding image to html
0 Votes
Links of cmy codes
4 Votes
Error...
1 Votes
Link
5 Votes