Comment on a computing the k shortest paths in a graph

Comment on a computing the k shortest paths in a graph

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Communications of the ACM 1977-08, Vol.20 (8), p.603-605
1. Verfasser: Lawler, Eugene L.
Format: Magazinearticle
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0001-0782
1557-7317
DOI:10.1145/359763.359804