Algorithms on Graphs

Software > Computer Software > Educational Software University of California San Diego

Course Overview

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.

Course FAQs

What are the prerequisites for 'Algorithms on Graphs'?

Prerequisites for this continuing education class are set by University of California San Diego. Most professional development online classes benefit from some prior knowledge. Please check the provider's page for specific requirements.

Will I receive a certificate for this CE class?

Yes, upon successful completion, University of California San Diego typically offers a shareable certificate to showcase your new skills and fulfill your continuing education requirements.

How long does this online course take to complete?

Completion times for online continuing education courses vary. The provider's website will have the most accurate estimate of the time commitment needed.