import Edge import FileProcess import KruskalAlgorithm import Graph import SteinerTree # Reading file FILENAME = "Data/"+input("Enter the file's name : Data/") inputFile = open(FILENAME, "r") # _____________________________________________________________________________________________________________________________ # Process tuple = FileProcess.fileProcess(inputFile.read()) inputFile.close() Edges = tuple[4] connectedNodes = tuple[3] terminalNodes = tuple[5] edgesNum = tuple[1] # number of edges nodesNum = tuple[0] # number of nodes terminalsNum = tuple[2] # number of nodes newEdges = KruskalAlgorithm.KruskalAlgorithm(Edges, connectedNodes, nodesNum, edgesNum) print(Graph.calculateCost(newEdges))# MST newEdges = SteinerTree.buildSteinerTree(nodesNum, terminalNodes, connectedNodes, newEdges)