anandketan / graphing_flight_paths Goto Github PK
View Code? Open in Web Editor NEWThe purpose of this project is to solve the shortest path problem, one of the fundamental theoretic problems known in graph theory, and how Dijkstra's algorithm can be used to solve it. Done as part of the final project for MOOC on Graph Theory by UCSD.
License: MIT License