
This directory contains a sample implementation of Dijkstra's shortest path
algorithm using the graph.q module. You'll also find a sample graph to play
with in the "G" file which was saved with graphed. (Not by accident, this is
the same graph as in my HP49 "GraphWriter" package. ;-)

-AG
