# Graph Algorithms

## Overview

In this course, part of the Algorithms and Data Structures MicroMasters® program, 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.

## Prerequisites

- Basic knowledge of common programming concepts, including loops, arrays, stacks, and recursion
- Basic knowledge of mathematics, including proof by induction and contradiction
- Algrorithmic Design and Techniques course
- Data Structures Fundamentals course

## Course Format

This course is self-paced, containing assignments without due dates. You can progress through the course at your own speed.

## Learn more and enroll on edX.