A Python implement of Dijkstra algorithm
Change Link State in the main.py
Host can be any node in the network
Output is:
1. The shortest distance of host and other nodes in the network
2. Previous node of each node along the shortest path to host
A Python implement of Dijkstra algorithm
A Python implement of Dijkstra algorithm
Change Link State in the main.py
Host can be any node in the network
Output is:
1. The shortest distance of host and other nodes in the network
2. Previous node of each node along the shortest path to host
A Python implement of Dijkstra algorithm