Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Rangkiang Mathematics Journal
Meira Perma Dewi
Unknown Affiliation
Mathematics Other

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Bellman-Ford Algorithm for Shortest Path Selection Afivah; Meira Perma Dewi
Rangkiang Mathematics Journal Vol. 4 No. 1 (2025): Rangkiang Mathematics Journal
Publisher : Department of Mathematics, Universitas Negeri Padang (UNP)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24036/rmj.v4i1.65

Abstract

Determining the shortest path from one point to another (destination) is a problem often encountered in life. With the development of science and technology, the problem of finding the shortest path can be solved using various algorithms. The algorithm that is often used to find the shortest route is the Bellman-Ford algorithm. The Bellman-Ford algorithm requires initial location parameters and a destination as input to determine the shortest path. The algorithm's results provide the shortest distance along with the route from the initial location to the destination. Applying the Bellman-Ford Algorithm provides the shortest distance as a solution to the problem. This research determines the shortest path from the origin to the destination point, modeled by a weighted graph. The Bellman-Ford algorithm starts the iteration by updating the distance at each vertex if a shorter distance is found.
Co-Authors Afivah