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

Advanced

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.

Apr 23, 2021 • 2h 0m

Triveni Mahatha

Watch now

ENGLISH

Advanced

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.

Apr 24, 2021 • 2h 0m

Triveni Mahatha

Watch now

ENGLISH

Advanced

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.

Apr 26, 2021 • 2h 0m

Triveni Mahatha

Watch now

ENGLISH

Advanced

Fundamental Graph Algorithms - IV (Interview Centric)

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.

Apr 27, 2021 • 2h 0m

Triveni Mahatha

Watch now

ENGLISH

Advanced

Fundamental Graph Algorithms - V (Interview Centric)

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?

Apr 28, 2021 • 2h 0m

Triveni Mahatha

Watch now

ENGLISH

Advanced

Fundamental Graph Algorithms - VI

In this session, Triveni will discuss how DFS can be used to find articulation points and bridges in a graph. Live coding will be used to understand the concepts clearly. Practice problems will be provided as well.

Apr 29, 2021 • 2h 0m

Triveni Mahatha

Watch now

Crack Competitive Programming with
India's largest learning platform

Get subscription and access unlimited live and recorded courses from India's best educators

Get subscription

Daily live classes

Chat with your educator, engage in discussions, ask your doubts, and answer polls - all while the class is going on

Live tests & quizzes

Evaluate your preparation with our regular mock tests and quizzes and get detailed analysis on your performance

Structured courses

All our courses are structured in line with your exam syllabus to help you best prepare for it

Unlimited access

One subscription gets you access to all our live and recorded courses to watch from the comfort of any of your devices
Group6674
Group6674

Get the app to continue

Watch live classes, take tests, combats and a lot more on the app