(*
 * dijkstra_test.sml - Test out the dijkstra algorithm
 *   Ronald Garcia
 *   $Id: dijkstra_test.sml,v 1.3 2003/08/08 18:17:00 garcia Exp $
 *)


use "dijkstra.sml";
use "graph242.sml";



structure DSP = 
MakeDijkstra(struct 
               structure VertexListGraph = ALGraph
               structure IncidenceGraph = ALGraph
               structure PredecessorMap = NumberMap
               structure DistanceMap = NumberMap
               structure WeightMap = EdgeMap
               structure VertexIndexMap = IndexMap
               structure Compare = NCompare
               structure Combine = NCombine
             end);


DSP.dijkstra_shortest_paths g
                            (hd (ALGraph.vertices(g)))
                            pmap
                            dmap
                            wmap
                            (IndexMap.create())
	                    (NCompare.create())
                            (NCombine.create())
                            999999 
                            0;