module Prim(prim_min_span_tree,
	    module Dijkstra) where
  import Graph
  import PropertyMap
  import Dijkstra

  prim_min_span_tree :: 
    (VertexListGraph g v, IncidenceGraph g e v, Ord v, Ord e, Ord n,
     ReadWritePropertyMap d v n, ReadPropertyMap w e n) => 
    g -> v -> d -> w -> (Comparer n) -> n -> (d,(FMap v v))
  prim_min_span_tree g s d1 w less zero = 
    dijkstra_shortest_paths g s d1 w less csnd zero
    where csnd a b = b