bera0422 / networkbasics Goto Github PK
View Code? Open in Web Editor NEWIn this project a country is modeled with edges and vertices and assigned two vertices as locations of Mecnun and Leyla. This program finds the shortest path for Mecnun to reach Leyla based on Dijkstra's algorithm, and then finds a honeymoon route for them which is actually a minimum spanning tree.