الصف : الثاني عشر - العام الدراسي : 2016/2017

If we have a map which shows many cities with the routes between it and we want to go from one to another…. If there are few cases we can enumerate all the routes between the two points, then add up the distances on each route, and select the shortest.

But if we have a lot of cases we can’t find it easily, we should use an algorithm which help us to find the shortest path and some applications need to find the shortest path and use it (maps applications, network routing….), so the programmer of this applications need to write a code which find the shortest path depending on shortest path algorithms.

in competitive programming: shortest path problems are one of the most important side in programming contests so every competitive programmer needs to use shortest path algorithms.

  تحميل   تصفح

  • حلقة بحث

    Shortest path algorithms

الإعداد :

  • كرم شبيب

الإشراف :

  • علي جنيدي

التقييم: (1)

قيّم المشروع :