Stojkovic, Natasa and Kocaleva, Mirjana and Zlatanovska, Biljana and Stojanova, Aleksandra (2019) Bellman-Ford and Floyd Warshall Algorithms for Easier Learning. In: ITRO 2019, June 27, 2019, Zrenjanin, Republic of Serbia.
Preview |
Text
Zbornik ITRO 2019 (1).pdf Download (3MB) | Preview |
Official URL: http://www.tfzr.rs/itro/Zbornik%20ITRO%202019.pdf
Abstract
In this paper, Bellman-Ford and FloyWarshall Algorithms will be considered. Floyd-Warshall is used when we want to find the shortest path between all the pairs of nodes in graph. The Bellman-Ford algorithm is similar to Dijkstra algorithm, but it is used when the graph may also contain links with negative weights. The algorithms are implemented in Java and visualized for easier learning.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Natural sciences > Computer and information sciences Natural sciences > Matematics |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Mirjana Kocaleva Vitanova |
| Date Deposited: | 13 Aug 2019 09:11 |
| Last Modified: | 13 Aug 2019 09:11 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/22324 |
Actions (login required)
 |
View Item |