Learn about the basic concepts of graph theory and how to represent graphs as data structures in code.

Become a C++ Programmer

Graph algorithms are the core of many real-world applications of computer science, such as automotive navigation or routing in computer networks. 

In this module, we’ll learn about the basic concepts of graph theory and how to represent graphs as data structures in code. We’ll study essential graph algorithms such as depth-first search or Dijkstra's algorithm to traverse graphs and find the shortest paths. Finally, we’ll learn to solve more complex optimization problems on graphs, such as matching and network flow problems.

Learn Graph Algorithms in C++

This course is about algorithms on **graphs**, which are data structures that represent a set of **nodes** interconnected by **edges**. An example of a graph is shown below:

graph g {
    bgcolor="transparent"
    a -- b
    a -- c
    b -- c
    a -- d
}

Although graphs are an abstract concept of mathematics and theoretical computer science, they can be used to model various problems from real-life applications. Some examples are:
- routing of IP packages on the internet.
- finding the fastest connection in public transportation systems.
- detecting deadlocks in operating system processes.

As such, graph algorithms can be a powerful and versatile tool in every software developer’s toolbox.

# A bit of history

The study of graph theory perhaps originated with the so-called **Königsberg bridge problem**. It is a neat example of modeling a real-life puzzle using graphs. 

The historical Prussian city of Königsberg (today Kalinigrad) consisted of four landmasses separated by rivers and connected by a total of seven bridges. In the early 18th century, mathematician Leonard Euler studied whether there was any way to devise a walk through the city that crosses each of the bridges exactly once. Today, hiss analysis of this problem is today seen as one of the founding moments of graph theory.

Euler modeled the city as a graph with each section of the city being represented by a node and each bridge between two sections represented by an edge. This graph is illustrated below.


Learn the concepts of graph theory and graph algorithms by studying the Königsberg bridge problem.

Introduction to Graph Algorithms

A bit of history