A simple dijkstra algorithm for my school project, to find the fastest path from each classes for incoming freshmans,

Create a .json file with a graph

eg. for rooms(my school example)

room_graph.json

{
  "room1": {"room2": 3, "room3": 2},
  "room2": {"room1": 4, "room3": 3},
  "room3": {"room1": 2, "room2": 1},
}

then, in line 61:

main.py

dijkstra_path_finder(graph, x, y)

In above x could be the starting point, then, y would be the target

To run dijkstra's algorithm in your specified .json file, in line 6:

main.py

graph_file = "NAME.json"

Remember to change the directed .json file to your specified .json file

The program is extremely scalable and you do not need to modify the main.py to scale up,

For example, You can create a script that reads the .json file of the graph, and change the weights of each nodes base on reports, I am currently working on a report system for my school dijkstra's algorithm project where student can report the traffic, and base on it, it will change the weights in the .json, and using pickle library to dump the data back in and create modification of the weights to the server

• Credits to my APCSP teacher for giving me and helping me to make this school project,