Using Floyd Algorithm to find the Shortest Path for Marketing the Gum Arabic in Sudan

المؤلفون

  • AbUALEZ ALAMIN AHMED ALI University of the Holy Qu an and Taseel of Sciences – Department of Mathematics and Physics,faculty of education
  • Yasmeen Sirag Osman Mohammed Gezira University

الكلمات المفتاحية:

Graph theory, shortest path problem, Floyd’s algorithm

الملخص

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

التنزيلات

منشور

2023-02-05

كيفية الاقتباس

ALAMIN AHMED ALI, A., & Sirag Osman Mohammed , Y. (2023). Using Floyd Algorithm to find the Shortest Path for Marketing the Gum Arabic in Sudan . مجلة البطانة للعلوم التطبيقية, (14), 130–147. استرجع في من http://journals.albutana.edu.sd/index.php/jas/article/view/209

إصدار

عدد 14 (2022): العدد الرابع عشر ديسمبر 2022

القسم

المقالات