Open AccessUnitary Partition Algorithm in Shortest Path Problems
Author(s) -
P Geetha,
A Gnanam,
S Suseela
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.c6874.098319
Subject(s) - shortest path problem , k shortest path routing , constrained shortest path first , shortest path faster algorithm , yen's algorithm , computer science , algorithm , unitary state , partition (number theory) , path (computing) , average path length , mathematics , theoretical computer science , dijkstra's algorithm , combinatorics , graph , computer network , political science , law
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 networks and social networks like road networks, railway networks, airline traffic networks, electrical networks and organizational charts, friendship networks, Interaction networks