Comment on a computing the k shortest paths in a graph

By Eugene L. Lawler

Communications of the ACM, Vol. 20 No. 8, Pages 603-605
10.1145/359763.359804

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.

The full text of this article is premium content

0 Comments

No entries found

Purchase the Article

Comment on a computing the k shortest paths in a graph

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine