Program realization of shortest path algorithms in transportation MIS (Q1101356)
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: Program realization of shortest path algorithms in transportation MIS |
scientific article; zbMATH DE number 4047465
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Program realization of shortest path algorithms in transportation MIS |
scientific article; zbMATH DE number 4047465 |
Statements
Program realization of shortest path algorithms in transportation MIS (English)
0 references
1987
0 references
We consider the problem of finding the shortest paths from a designated vertex to other vertices in a directed graph. The Dijkstra algorithm for the solution of this problem is discussed and its realization in MIS software is considered. A new priority-queue realization of the algorithm is proposed, which ensures efficient construction of the shortest paths without constraints on the input data.
0 references
shortest paths
0 references
designated vertex
0 references
directed graph
0 references
Dijkstra algorithm
0 references
priority-queue realization
0 references
0.7967671751976013
0 references
0.7929840087890625
0 references
0.7877593636512756
0 references
0.7811706066131592
0 references
