Shortest Path: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
The Shortest Path is the problem to the path between two nodes in a graph where the sum of the weight of the nodes is the minimum. | The Shortest Path is the problem where we want to find the path between two nodes in a graph where the sum of the weight of the nodes is the minimum. | ||
== Resources == | == Resources == | ||
Latest revision as of 07:58, 10 May 2019
The Shortest Path is the problem where we want to find the path between two nodes in a graph where the sum of the weight of the nodes is the minimum.
Resources
| https://en.wikipedia.org/wiki/Shortest_path_problem |