Program realization of shortest path algorithms in transportation MIS

MaRDI QIDQ1101356zbMATH OpenFDO

Authors S. M. Androsov, B. Yu. Gluzman, V. A. Oslon

Publication date 1987

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

designated vertexDijkstra algorithmdirected graphpriority-queue realizationshortest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Review text

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.

Recommendations

• Shortest path methods: A unifying approach
• Microcomputer-based algorithms for large scale shortest path problems
• scientific article; zbMATH DE number 3937196
• Faster algorithms for the shortest path problem
• An Appraisal of Some Shortest-Path Algorithms

Cited in

(2)

• scientific article; zbMATH DE number 4035604 (Why is no real title available?)
• scientific article; zbMATH DE number 882129 (Why is no real title available?)

This page was built for publication: Program realization of shortest path algorithms in transportation MIS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101356)