Comment on a computing the k shortest paths in a graph
- 1 August 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (8) , 603-605
- https://doi.org/10.1145/359763.359804
Abstract
In [1] Hardgrave discusses “positional” versus keyword parameter communication with subprograms from the viewpoint of structured programming. In this note an additional argument in favor of the keyword approach is suggested.Keywords
This publication has 3 references indexed in Scilit:
- More on k th shortest pathsCommunications of the ACM, 1975
- On computing sets of shortest paths in a graphCommunications of the ACM, 1974
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969