期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2012
卷号：3
期号：6
页码：5296-5300
出版社：TechScience Publications
摘要：In the modern world, planning efficient routes is essential for business and industry, with applications as varied as product distribution. Networks are used to move people, transport goods, communicate information and control the flow of matter and energy. Networks are all around us. Roads, railways, cables, pipelines are phenomena that frequently need to be represented and analyzed as a network. The complexity of network, cost and time required for networking is increasing in different kinds of network based systems. (e.g., T.V. cable networks, Telephone networks, Electricity supply networks, Gas pipe network and water supply system). A graph is a mathematical abstraction that is useful for solving many kinds of problems. Finding shortest paths plays an important role in such kind of network based systems. In graph theory number of algorithms can be applied for finding shortest paths in a graph based network system. It reduces complexity of network paths, cost and time to build and maintain network based systems. In this review of literature authors have reviewed the literatures. This work addresses the problem by presenting analysis of different researches on shortest path problem in various areas of applications. This paper analysis different shortest path algorithms like Dijkstra’s Algorithm, Bellman ford Algorithm and Warshall’s Algorithm by considering network base systems such as Cable network (T.V. cabling, Telephone cabling, Electricity power supply network) and water supply system network. This review of literature also aims to encourage additional research on topics, and concludes with several suggestions for further research.
关键词：Graph; Network based systems; shortest path;problem; Dijkstra’s Algorithm; Bellman ford Algorithm and;Warshall’s Algorithm.
