Exemplo n.º 1
0
 public MstGraph(List <Framework.Graph.Prim.MinimumSpanningTree.MstEdge> edgeList)
 {
     this.edgeList = edgeList;
     adjList       = new LinkedList <Framework.Graph.Prim.MinimumSpanningTree.MstEdge> [MAX_NODES];
     for (int i = 0; i < MAX_NODES; ++i)
     {
         adjList[i] = new LinkedList <Framework.Graph.Prim.MinimumSpanningTree.MstEdge>();
     }
     initAdjList();
     length = EdgeHandler.calculateNumNodes(edgeList);
 }
Exemplo n.º 2
0
 public Prim(string inputFile)
 {
     edgeList = EdgeHandler.initEdges(inputFile);
     graph    = new MstGraph(edgeList);
     parent   = new int[graph.Length + 1];
 }
Exemplo n.º 3
0
 public Kruskal(string inputFile)
 {
     edge     = EdgeHandler.initEdges(inputFile);
     numNodes = EdgeHandler.calculateNumNodes(edge);
 }