Unitary Partition Algorithm in Shortest Path Problems
P. Geetha1, A.Gnanam2, S. Suseela3
1P. Geetha Assistant Professor, Department of Mathematics, Periyar Maniammai Institute of Science & Technology, Periyar Nagar, Vallam, Thanjavur.
2A.Gnanam Assistant Professor, Department of Mathematics, Government Arts College, Thuvakkudi malai, Trichy.
3S. Suseela Assistant Professor, Department of Compute Science and Engineering, Periyar Maniammai Institute of Science & Technology, Periyar Nagar, Vallam, Thanjavur.
Manuscript received on 11 August 2019. | Revised Manuscript received on 14 August 2019. | Manuscript published on 30 September 2019. | PP: 5307-5311 | Volume-8 Issue-3 September 2019 | Retrieval Number: C6874098319/2019©BEIESP | DOI: 10.35940/ijrte.C6874.098319
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Partitions, Complete Partitions, Unitary Partitions Algorithm.
Scope of the Article: Web Algorithms