node21.adjacenciesList.append(edge23) node22.adjacenciesList.append(edge24) unvisitedList = [] unvisitedList.append(node1) unvisitedList.append(node2) unvisitedList.append(node3) unvisitedList.append(node4) unvisitedList.append(node5) unvisitedList.append(node6) unvisitedList.append(node7) unvisitedList.append(node8) unvisitedList.append(node9) unvisitedList.append(node10) unvisitedList.append(node11) unvisitedList.append(node12) unvisitedList.append(node13) unvisitedList.append(node14) unvisitedList.append(node15) unvisitedList.append(node16) unvisitedList.append(node17) unvisitedList.append(node18) unvisitedList.append(node19) unvisitedList.append(node20) unvisitedList.append(node21) unvisitedList.append(node22) unvisitedList.append(node23) algorithm = Algorithm(unvisitedList) algorithm.constructSpanningTree(node1)
from Vertex import Vertex
from Edge import Edge
from Algorithm import Algorithm
vertex1 = Vertex("A")
vertex2 = Vertex("B")
vertex3 = Vertex("C")
vertex4 = Vertex("D")
vertex5 = Vertex("E")
vertex6 = Vertex("F")
edge1 = Edge(2, vertex1, vertex2)
edge2 = Edge(4, vertex1, vertex4)
edge3 = Edge(4, vertex2, vertex3)
edge4 = Edge(4, vertex2, vertex4)
edge5 = Edge(3, vertex2, vertex5)
edge6 = Edge(1, vertex2, vertex6)
edge7 = Edge(5, vertex3, vertex6)
edge8 = Edge(2, vertex4, vertex5)
edge9 = Edge(5, vertex5, vertex6)
vertexList = [vertex1, vertex2, vertex3, vertex4, vertex5, vertex6]
edgeList = [edge1, edge2, edge3, edge4, edge5, edge6, edge7, edge8, edge9]
algorithm = Algorithm()
algorithm.constructSpanningTree(vertexList, edgeList)
