English: The image shows a weighted graph with five nodes (A, B, C, D, E) and edges with specified weights. It demonstrates Dijkstra's algorithm for finding the shortest path from node A to node E. The shortest path, A → C → D → E, has a total weight of 12.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
http://creativecommons.org/publicdomain/zero/1.0/deed.enCC0Creative Commons Zero, Public Domain Dedicationfalsefalse
This media file is uncategorized.
Please help improve this media file by adding it to one or more categories, so it may be associated with related media files (how?), and so that it can be more easily found.
Please notify the uploader with
{{subst:Please link images|File:Shortest path example graph.png}} ~~~~
Captions
The image shows a weighted graph with five nodes (A, B, C, D, E) and edges with specified weights. It demonstrates Dijkstra's algorithm for finding the shortest path from node A to node E. The shortest path, A → C → D → E, has a total weight of 12.