this is to caculate A to B, the shortest distance

The Main.py is the entrance of the project
The modified Dijkstra algorithm is advanced that it will return the shortest distance as far as it gets the given route A-B, if A and B are in the graph. A and B can be any vertex in graph.

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
__pycache__		__pycache__
Action.py		Action.py
Edge.py		Edge.py
Graph.py		Graph.py
Main.py		Main.py
README.md		README.md
Vertex.py		Vertex.py
data		data

Provide feedback