Dijkstra Algorithm Application: Shortest Distance between Buildings

  • Authors

    • G. Deepa
    • Priyank Kumar
    • A. Manimaran
    • K. Rajakumar
    • V. Krishnamoorthy
    2018-10-02
    https://doi.org/10.14419/ijet.v7i4.10.26638
  • directed graph (DG), DA, SP

  • Abstract

    The shortest path algorithm is one of the best choices for implementation of data structures. The shortest path (SP) problem involves the problem of finding a suitable path between “two vertices or nodes in a graph†in such a way that the sum of the weights of its component edges is minimal. There are many theories for solving this problem one of the widely used way solution for solving this problem is Dijkstra’s algorithm (DA) which is also widely used in many engineering calculation works also. There are two types of DA one is the basic one and other one is optimized. This paper is focused on the basics one which provides a shortest route between source node and the destination node. Main focus has been kept on keeping the work simple and easy to understand with some basic concepts .Storage space and operational efficiency improvement has been tried to improve.

     

  • References

    1. [1] B.S. Hasan, M.A. Khamees and A.S.H. Mahmoud (2007), A Heuristic Genetic Algorithm for the Single Source Shortest Path Problem, Proc. of International Conference on Computer Systems and Applications, pp.187-194.

      [2] J. Chamero (2006), Dijkstra's Algorithm Discrete Structures and Algorithms.

      [3] T. Li, L. Qi, and D. Ruan (2008), An Efficient Algorithm for the Single-Source Shortest Path Problem in Graph Theory, Proc. of 3rd International Conference on Intelligent System and Knowledge Engineering, Vol. 1 , pp. 152-157.

      [4] YAN Han-Bing LIU Ying-Chun (2000), A New Algorithm for Finding Shortcut in a City's Road Net Based on GIS Technology, Chinese Journal of Computers, Vol. 23, No.2, pp. 210-215.

      [5] Arun Kumar Sangaiah, Minghao Han and Suzi Zhang (2014), An Investigation of Dijkstra and Floyd Algorithms in National City Traffic Advisory Procedures, IJCSMC, Vol. 3, No. 2, pp. 124-138.

      [6] F. Benjamin Zhan (1997), Three fastest shortest path algorithms on real road networks: Data structures and procedures, Journal of geographic information and decision analysis, Vol. 1, No.1, pp. 69-82.

      [7] https://www.inf.ed.ac.uk/teaching/courses/dmmr/slides/17-18/lec-shortest-coloring.pdf.

      [8] https://andrew.hedges.name/experiments/haversine/.

  • Downloads

  • How to Cite

    Deepa, G., Kumar, P., Manimaran, A., Rajakumar, K., & Krishnamoorthy, V. (2018). Dijkstra Algorithm Application: Shortest Distance between Buildings. International Journal of Engineering & Technology, 7(4.10), 974-976. https://doi.org/10.14419/ijet.v7i4.10.26638

    Received date: 2019-01-29

    Accepted date: 2019-01-29

    Published date: 2018-10-02