• FINDING THE SHORTEST PATH BETWEEN ALL THE STATE CAPITAL CITIES OF INDIA
Abstract
In this paper methods of finding shortest path between the 27 capital cities in India using Graph theoretic algorithms namely kruskal’s and prim’s algorithms are discussed. The aim is to overcome longer distance that consumes more time and cost.
Full Text:
PDF
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |