Base implementation Dijkstra algorithm for Shortest Paths with json files manipulation.
Json files are to deliver connections in graphs and proper weights. Examplary code to run is in main.py file
To see results of algorithm please just run main file in python IDE eg. PyCharm or sPyder.