第07章加权图weightedgrahs.pptVIP

Weighted Graphs Shortest Path Weighted Graphs Outline and Reading Weighted graphs (§7.1) Dijkstra’s algorithm (§7.1.1) The Bellman-Ford algorithm (§7.1.2) Shortest paths in dags (§7.1.3) All-pairs shortest paths (§7.2.1) Shortest Path via Matrix Multiplication (§7.2.2) – No slide on this section- too mathematical for slides! Minimum Spanning Trees (§7.3) The Prim-Jarnik Algorithm (§7.3.2) Kruskals Algorithm (§7.3.1) Baruvkas Algorithm (§7.3.3) Weighted Graphs In a weighted graph, each edge has an associated numerical value, called the weight of the edge Edge weights may represent, distances