from Dijkstra.Vertex import Vertex
from Dijkstra.Edge import Edge
from Dijkstra.Algorithm import Algorithm

node1=Vertex("A")
node2=Vertex("B")
node3=Vertex("C")

edge1 = Edge(1,node1,node2)
edge2 = Edge(1,node2,node3)
edge3 = Edge(0.1,node1,node3)


node1.adjanciesList.append(edge1)
node1.adjanciesList.append(edge2)
node2.adjanciesList.append(edge3)


vertexList = {node1,node2,node3}

algorithm = Algorithm()
algorithm.calculateShortestPath(vertexList, node1)
algorithm.getShortestPath(node3)