Joint Workshop KO2PI and The 1st International Conference on Advance & Scientific Innovation

Research Article

Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem

Download143 downloads
  • @INPROCEEDINGS{10.4108/eai.23-4-2018.2277598,
        author={Zuhri Ramadhan and Andysah Putera Utama Siahaan and M. Mesran},
        title={Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem},
        proceedings={Joint Workshop KO2PI and The 1st International Conference on Advance \& Scientific Innovation},
        publisher={EAI},
        proceedings_a={ICASI},
        year={2018},
        month={7},
        keywords={shortest path prim floyd-warshall optimation routing},
        doi={10.4108/eai.23-4-2018.2277598}
    }
    
  • Zuhri Ramadhan
    Andysah Putera Utama Siahaan
    M. Mesran
    Year: 2018
    Prim and Floyd-Warshall Comparative Algorithms in Shortest Path Problem
    ICASI
    EAI
    DOI: 10.4108/eai.23-4-2018.2277598
Zuhri Ramadhan1,*, Andysah Putera Utama Siahaan1, M. Mesran2
  • 1: Faculty of Science and Technology, Universitas Pembangunan Panca Budi, Medan, Indonesia
  • 2: Department of Computer Informatics, STMIK Budi Darma, Indonesia
*Contact email: ramadhanzoe@pancabudi.ac.id

Abstract

Optimization is an effort to obtain the best results by considering the constraints, constraints, and limitations that exist on a problem; the goal is to minimize or suppress the things that harm and maximize the things that are considered profitable. Generally, the Floyd-Warsall algorithm is widely used to solve shortest path problems, while the Prim algorithm is often used to solve the MST (Minimum Spanning Tree) problem in the Graph to minimize tree ranges or reduce the number of branches. Comparing the Prim algorithm with the Floyd-Warsall algorithm is expected to add proof if the Prim algorithm is not only used to solve Minimum Spanning Tree problem but can also solve the problem of Shortest Path Problem.