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.