from edge import Edge from node import Node from algorithm import Algorithm import mapdata algorithm = Algorithm() start = mapdata.user_start_node end = mapdata.node7 algorithm.calculateShortestPath(mapdata.vertexList, start) algorithm.getShortestPath(start, end)
node13.adjacenciesList.append(edge41)
node13.adjacenciesList.append(edge42)
node14.adjacenciesList.append(edge43)
node14.adjacenciesList.append(edge44)
node14.adjacenciesList.append(edge45)
node14.adjacenciesList.append(edge46)
node15.adjacenciesList.append(edge47)
node15.adjacenciesList.append(edge48)
node15.adjacenciesList.append(edge49)
node16.adjacenciesList.append(edge50)
node16.adjacenciesList.append(edge51)
node17.adjacenciesList.append(edge52)
node17.adjacenciesList.append(edge53)
node17.adjacenciesList.append(edge54)
node18.adjacenciesList.append(edge55)
node18.adjacenciesList.append(edge56)
node18.adjacenciesList.append(edge57)
node19.adjacenciesList.append(edge58)
node19.adjacenciesList.append(edge59)
node19.adjacenciesList.append(edge60)
node20.adjacenciesList.append(edge61)
node20.adjacenciesList.append(edge62)
vertexList = {
node1, node2, node3, node4, node5, node6, node7, node8, node9, node10
}
algorithm = Algorithm(node1, node20)
algorithm.calculateShortestPath(vertexList)
algorithm.getShortestPath()
from algorithm import Algorithm
from edge import Edge
from node import Node
node1 = Node('A')
node2 = Node('B')
node3 = Node('C')
node4 = Node('D')
edge1 = Edge(1, node1, node2)
edge2 = Edge(1, node2, node3)
edge3 = Edge(1, node3, node4)
edge4 = Edge(-10, node3, node2)
edge5 = Edge(300, node1, node4)
node1.adjacencies.append(edge1)
node1.adjacencies.append(edge2)
node2.adjacencies.append(edge3)
node3.adjacencies.append(edge4)
node3.adjacencies.append(edge2)
nodeList = {node1, node2, node3, node4}
edgeList = [edge1, edge2, edge3, edge4, edge5]
algorithm = Algorithm()
algorithm.calculateShortestPath(nodeList, edgeList, node1)
algorithm.getShortestPath(node4)
from vertex import Vertex
from edge import Edge
from algorithm import Algorithm
vertex1 = Vertex('A')
vertex2 = Vertex('B')
vertex3 = Vertex('C')
edge1 = Edge(1, vertex1, vertex2)
edge2 = Edge(1, vertex2, vertex3)
edge3 = Edge(10, vertex1, vertex3)
vertex1.adjacencies.append(edge1)
vertex1.adjacencies.append(edge2)
vertex2.adjacencies.append(edge3)
vertexList = {vertex1, vertex2, vertex3}
algorithm = Algorithm()
algorithm.calculateShortestPath(vertexList, vertex1)
algorithm.getShortestPath(vertex3)
