Overview
If you have ever used a navigation service to find the 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, water and electricity supply networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect 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 the Graph Algorithms Certificate, part of the Algorithms and Data Structures MicroMasters Program from EdX in partnership with University of California, San Diego - UC San DiegoX, you will learn what a graph is and its most important properties. You’ll learn several ways to traverse graphs and how you can do useful things while traversing the graph in some order. We will also talk about shortest paths algorithms. 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.
What you'll learn
- Graph exploration and decomposition into connected components
- Shortest paths algorithms, including breadth-first search, Dijkstra’s algorithm and Bellman-Ford algorithm
- Minimum spanning tree algorithms
Get more details
Visit programme websiteProgramme Structure
Courses Include:
- Decomposition of Graphs
- Shortest Paths
- Minimum Spanning Trees
- Flows in Networks
Check out the full curriculum
Visit programme websiteKey information
Duration
- Part-time
- 2 months
Start dates & application deadlines
Language
Delivered
- Self-paced
Disciplines
Mathematics Information Technology (IT) Computer Sciences View 50 other Short Courses in Mathematics in United StatesExplore more key information
Visit programme websiteAcademic requirements
We are not aware of any specific GRE, GMAT or GPA grading score requirements for this programme.
English requirements
We are not aware of any English requirements for this programme.
Other requirements
General requirements
Prerequisites
Basic knowledge of:
- At least one programming language-loops, arrays, stacks, recursion.
- Math-proof by induction, proof by contradiction
- The Algorithmic Design and Techniques and Data Structures Fundamentals classes
Make sure you meet all requirements
Visit programme websiteTuition Fee
-
International
150 USD/fullTuition FeeBased on the tuition of 150 USD for the full programme during 2 months. -
National
150 USD/fullTuition FeeBased on the tuition of 150 USD for the full programme during 2 months.
- Unlimited access + verified certificate: $150
- Limited access: free