+ 1
The technique is used in the following graph algorithms which have many practical applications:
Ā
1. Dijkstra's algorithm for finding shortest path to all nodes given a start node
2. Prim's algorithm for finding a minimum spanning tree
3. Huffman trees for data compression
Often have questions like this?
Learn more efficiently, for free:
Hot today
Is this realistic enough?
1 Votes
Need friends
0 Votes
"Whatās the best way to combine creativity and coding? Can storytelling improve web apps?"
1 Votes
Python
1 Votes