bellman forge, dijkstra's, prim's algorithm, kruskals, directed acrylic graph

Question

What are some real life examples where each one of these are used?

Answer 1

Bellman-Ford + Djikstra: Shortest paths, navigational systems.

Prim's + Kruskal: Minimum spanning trees, used for example in approximating the famous-infamous Traveling Salesman Problem.

Answer 2

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)

Answer 3

In router for making routing decisions.

Answer 4

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.

Answer 5

Dijkstra's algorithm, on every other question tagged algorithm on stackoverflow