Welcome to the Dijkstra's algorithm simulator.

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph.

For a given source node in the graph, the algorithm finds the shortest path between that node and every other. It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined.

Since we can represent this model using a graph, we can use Dijkstra's algorithm to simulate an underground network.

Each node of the graph corresponds to a station. The edges between each node correspond to the possible routes between the stations.

Each edge has a label which corresponds to the distance between two stations.

For the purpose of this simulator, we will explore Dijkstra's algorithm with some well known underground networks where you will have to find the shortest route between two stations.

Enough theory, let's get started with it!