A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs (Q1173022)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs |
scientific article; zbMATH DE number 3791968
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs |
scientific article; zbMATH DE number 3791968 |
Statements
A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs (English)
0 references
1983
0 references
graph of nonnegative arcs
0 references
shortest path
0 references
directed nonnegatively weighted graph
0 references
Dijkstra's algorithm
0 references
