TWiki > Doc > CodeExamples > GraphParametricTypeExample > PrimMinimumSpanningTreeExample	TWiki webs: Dev | Doc | Main | TWiki | Sandbox
	Doc . { Changes | Index | Search | Go }

// compilation unit Prim.nice
package graph;

<Edge,Vertex,Distance,T | Edge <: GraphEdge<Vertex> > 
void primMinimumSpanningTree(
   VertexListAndIncidenceGraph<Vertex,Edge> graph,
   Vertex s,
   ReadWritePropertyMap<Vertex,Vertex> predecessor,
   ReadWritePropertyMap<Vertex,Distance> distance,
   ReadablePropertyMap<Edge,Distance> weight,
   (Distance, Distance)->boolean compare,
   Distance inf,
   Distance zero
   ){
   
   dijkstraShortestPaths(
      graph, s, predecessor, distance, weight, compare, 
      (Distance d1, Distance d2)=>d2, 
      inf, zero);
}