A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. (Q1607102)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. |
scientific article |
Statements
A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation. (English)
0 references
25 July 2002
0 references
