// Copyright 2003, Trustees of Indiana University
// Please see the license in the file ../LICENSE

// prim_minimum_spanning_tree algorithm from BFS

import java.lang.*;

public class prim_minimum_spanning_tree {
  public static <
    Vertex,
    Edge extends GraphEdge<Vertex>,
    VertexIterator extends java.util.Iterator<Vertex>,
    OutEdgeIterator extends java.util.Iterator<Edge>,
    WeightMap extends ReadablePropertyMap<Edge,Distance>,
    DistanceMap extends ReadWritePropertyMap<Vertex,Distance>,
    Distance,
    DistanceCompare extends StrictWeakOrdering<Distance>,
    PredecessorMap extends ReadWritePropertyMap<Vertex,Vertex>>

  void prim_minimum_spanning_tree(VertexListAndIncidenceGraph<Vertex,Edge,VertexIterator,OutEdgeIterator> g, Vertex s, PredecessorMap predecessor, DistanceMap distance, WeightMap weight, DistanceCompare compare, Distance inf, Distance zero) {
    project2nd<Distance> combine = new project2nd<Distance>();
    dijkstra_shortest_paths.dijkstra_shortest_paths(g,s,predecessor,distance,weight,compare,combine,inf,zero);
  }
}