Using Floyd Algorithm to find the Shortest Path for Marketing the Gum Arabic in Sudan
Keywords:
Graph theory, shortest path problem, Floyd’s algorithmAbstract
In this paper Floyd’s algorithm was utilize to find out the shortest path for
marketing cities of Gum Arabic between fourteen major marketing cities in
Sudan. After completing the algorithm we found that the route with smallest
distance is (Nyala, AlObied, Omdurman, Atbara, Port Sudan) with length 1650
Km
Downloads
Published
2023-02-05
How to Cite
ALAMIN AHMED ALI, A., & Sirag Osman Mohammed , Y. (2023). Using Floyd Algorithm to find the Shortest Path for Marketing the Gum Arabic in Sudan . Al-Butana Journal of Applied Sciences, (14), 130–147. Retrieved from https://ojs.albutana.edu.sd/index.php/jas/article/view/209
Issue
Section
الأوراق البحثية