Unitary Partition Algorithm in Shortest Path Problems

2019 International journal of recent technology and engineering  
In Existing system, a network consists of N(V,E) to find a shortest path to minimize the total cost from source to destination. Researchers have been proposed many algorithms for finding the shortest path like two familiar algorithms namely Prim's algorithm and Kruskal's algorithm. In this paper we provide a new approach to solve the shortest path problems using unity partitions algorithm in C programme. We may apply this unitary partitions algorithm to find the shortest path in physical
more » ... s and social networks like road networks, railway networks, airline traffic networks, electrical networks and organizational charts, friendship networks, Interaction networks
doi:10.35940/ijrte.c6874.098319 fatcat:mfzcqdkiivfwjcedjro565in2q