Algorithms on Graphs
half-circle
vector

Algorithms on Graphs

أبرز محتويات الدورة

If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect a set of computers into a network or efficient algorithm to automatically find communities and opinion leaders in Facebook, you're going to work with graphs and algorithms on graphs. In this online course, you will first learn what a graph is and what are some of the most important properties. Then you'll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will then talk about shortest paths algorithms "� from the basic ones to those which open door for 1000000 times faster algorithms used in Google Maps and other navigational services. You will use these algorithms if you choose to work on our Fast Shortest Routes industrial capstone project. We will finish with minimum spanning trees which are used to plan road, telephone and computer networks and also find applications in clustering and approximate algorithms.

حول مقدم الدورة

Coursera provides access to more than 3000+ courses across a wide variety of subjects in parntership with different universities and organizations.

الطبع بواسطة

  • self
    التعلم الذاتي
  • dueration
    المدة 55 ساعات
  • domain
    الاختصاص تقنية المعلومات وعلوم الحاسب
  • subs
    Monthly Subscription
    Course is included in
    1. الباقة الإبتدائية @ AED 99 + VAT
    2. الباقة الاحترافية @ AED 149 + VAT
  • fee
    Buy Now AED 274.99 + VAT
  • language
    اللغة الإنكليزية