# FREE Course on Graph Algorithms

In this course, you will learn to represent a contest problem into a graph problem. The techniques to traverse them. Specific concepts on specific types of graphs and algorithms to find them, such as - topological sorting of DAG, strongly connected component, articulation points, etc. Live examples and coding will be used during the sessions to enhance learning. Practice problems will be provided at the end as well.

ENGLISH

Beginner

#### Fundamental Graph Algorithms - I

In this session, Triveni will discuss why do we need to study about graphs. What are the various types of graphs. And, how to represent them inside a computer program.

Feb 5, 2021 • 2h 0m

Triveni Mahatha

ENGLISH

Beginner

#### Fundamental Graph Algorithms - II

In this session, Triveni will discuss more about graphs and how to traverse a graph. The BFS algorithm will be discussed in detail. Live coding will be used to help you understand it better.

Feb 6, 2021 • 2h 0m

Triveni Mahatha

ENGLISH

Beginner

#### Fundamental Graph Algorithms - III

In this session, Triveni will discuss about the DFS algorithm. Live coding will be used to enhance the learning experience. Classification of edges - back edge, cross edge, tree edge, forward edge - will be discussed.

Feb 8, 2021 • 2h 0m

Triveni Mahatha

ENGLISH

#### Fundamental Graph Algorithms - IV

In this session, Triveni will discuss about directed graphs. In particular, Directed Acyclic Graph (DAG) and, how to find topological sorting of a DAG, will be discussed.

Feb 9, 2021 • 2h 0m

Triveni Mahatha

ENGLISH

#### Fundamental Graph Algorithms - V

In this session, Triveni will discuss more about directed graphs. In particular, the concept of connected components will be extended to directed graphs. How to find Strongly Connected Components?

Feb 10, 2021 • 2h 0m

Triveni Mahatha

ENGLISH