An improvement of Dijkstra's method for finding a shortest path in a graph (Q1072570): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:05, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improvement of Dijkstra's method for finding a shortest path in a graph |
scientific article |
Statements
An improvement of Dijkstra's method for finding a shortest path in a graph (English)
0 references
1986
0 references
A slight modification of Dijkstra's original method is presented. If a lower bound on the length of the shortest path between two nodes of a network is known, this modification allows to save up to 35 \% of the computing time which would be required for the original method.
0 references
Dijkstra's algorithm
0 references
shortest path
0 references
