Priority Queue Tests -- Dijkstra Problems

Here's what you have to do to run the Dijkstra problems for Priority Queue tests in DIMACS Challenge 5. These files form a subset of Andrew Goldberg's SPLIB library of shortest-paths programs; they were modified for use in Challenge 5 by C. McGeoch.

Send Cathy a note if you have questions or need help.

Back to the Challenge.

Back to the Priority Queue Tests.

This page is maintained by C.C. McGeoch, who can be reached at ccm@cs.amherst.edu