An improved Dijkstra's shortest path algorithm for sparse network (Q870157): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 360 / rank | |||
Normal rank | |||
Revision as of 11:56, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved Dijkstra's shortest path algorithm for sparse network |
scientific article |
Statements
An improved Dijkstra's shortest path algorithm for sparse network (English)
0 references
12 March 2007
0 references
Dijkstra's shortest path algorithm
0 references
comparison-addition model
0 references
Fibonacci heap
0 references
numerical examples
0 references
sparse networks
0 references
road traffic networks
0 references
