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

import java.lang.*;

public class prim_test {
  public static void main(String[] args) {
    adjacency_list g = new adjacency_list();

    hash_property_map<Integer,Integer> pred_map = new hash_property_map<Integer,Integer>();

    hash_property_map<Integer,Double> distance_map = new hash_property_map<Integer,Double>();

    hash_property_map<adj_list_edge<Integer>,Double> weight_map = new hash_property_map<adj_list_edge<Integer>,Double>();

    g.add_vertex(new Integer(3));
    distance_map.set(new Integer(3), new Double(0));
    g.add_vertex(new Integer(4));
    distance_map.set(new Integer(4), new Double(Double.POSITIVE_INFINITY));
    g.add_vertex(new Integer(5));
    distance_map.set(new Integer(5), new Double(Double.POSITIVE_INFINITY));
    g.add_vertex(new Integer(6));
    distance_map.set(new Integer(6), new Double(Double.POSITIVE_INFINITY));
    g.add_edge(new Integer(3), new Integer(6));
    weight_map.set(new adj_list_edge<Integer>(new Integer(3), new Integer(6)), new Double(1));
    g.add_edge(new Integer(6), new Integer(3));
    weight_map.set(new adj_list_edge<Integer>(new Integer(6), new Integer(3)), new Double(1));
    g.add_edge(new Integer(3), new Integer(5));
    weight_map.set(new adj_list_edge<Integer>(new Integer(3), new Integer(5)), new Double(8));
    g.add_edge(new Integer(5), new Integer(3));
    weight_map.set(new adj_list_edge<Integer>(new Integer(5), new Integer(3)), new Double(8));
    g.add_edge(new Integer(4), new Integer(5));
    weight_map.set(new adj_list_edge<Integer>(new Integer(4), new Integer(5)), new Double(1));
    g.add_edge(new Integer(5), new Integer(4));
    weight_map.set(new adj_list_edge<Integer>(new Integer(5), new Integer(4)), new Double(1));
    g.add_edge(new Integer(6), new Integer(4));
    weight_map.set(new adj_list_edge<Integer>(new Integer(6), new Integer(4)), new Double(2));
    g.add_edge(new Integer(4), new Integer(6));
    weight_map.set(new adj_list_edge<Integer>(new Integer(4), new Integer(6)), new Double(2));
    g.add_edge(new Integer(4), new Integer(3));
    weight_map.set(new adj_list_edge<Integer>(new Integer(4), new Integer(3)), new Double(3));
    g.add_edge(new Integer(3), new Integer(4));
    weight_map.set(new adj_list_edge<Integer>(new Integer(3), new Integer(4)), new Double(3));

    prim_minimum_spanning_tree.prim_minimum_spanning_tree(
      g, 
      new Integer(3), 
      pred_map,
      distance_map,
      weight_map,
      new StrictWeakOrdering<Double>() {public boolean less(Double a, Double b) {return a.doubleValue()<b.doubleValue();}},
      new Double(Double.POSITIVE_INFINITY),
      new Double(0.));

    for (int i = 3; i < 7; ++i)
      System.out.println("Pred(" + i + ") = " + pred_map.get(new Integer(i)));
  }
}