问题
What are some real life examples where each one of these are used?
回答1:
Dijkstra's algorithm, on every other question tagged algorithm on stackoverflow
回答2:
Bellman-Ford + Djikstra: Shortest paths, navigational systems.
Prim's + Kruskal: Minimum spanning trees, used for example in approximating the famous-infamous Traveling Salesman Problem.
回答3:
In router for making routing decisions.
回答4:
Prim, Kruskals - Network Spanning Tree Protocol
Dijkstra - GPS Maps and routing eg. Maps Google.
DAG - For easy implement tree hierarchy.
Bellman-Ford - RIP (Routing Information Protocol)
回答5:
Dijkstra's algorithm (see Wikipedia) is a path-finding algorithm. It is used to find shortest paths through graphs, e.g. for maps and for game AI (e.g. finding an efficient route when you or the computer tell troops to go from point A to point B).
A popular improved version of the algorithm is the A* search algorithm.
来源：https://stackoverflow.com/questions/2733051/bellman-ford-dijkstras-prims-algorithm-kruskals-directed-acyclic-graph