Shortest Paths
0. A. 4. 8. 2. 8. 2. 3. 7. 1. B. C. D. 3. 9. 5. 8. 2. 5. E. F. Shortest Paths. Weighted Graphs. In a weighted graph, each edge has an associated numerical value, called the weight of the edge Edge weights may represent, distances, costs, etc. Example:
220 views • 17 slides