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); }
public Prim(string inputFile) { edgeList = EdgeHandler.initEdges(inputFile); graph = new MstGraph(edgeList); parent = new int[graph.Length + 1]; }
public Kruskal(string inputFile) { edge = EdgeHandler.initEdges(inputFile); numNodes = EdgeHandler.calculateNumNodes(edge); }