In any Data Structures and Algorithms interview, Graphs are one of the most important topics. This course is designed to help a candidate master Graphs.

This course provides a detailed insight into graphs. It is designed to help candidates learn graphs from a very basic to cracking any graph problem. In this course, each topic is explained in detail, ensuring the coverage of all important fundamentals, followed by many problems covering all varieties of concepts and difficulty levels.

Deep dive into Graph Algorithms: Beginner to Interview Ready

## Undirected graphs: Graphs with no direction

As we had discussed in the [previous lesson](https://www.educative.io/pageeditor/6586453712175104/6183745633124352/5973124278910976) about how we represent graphs, we had also touched a little bit on what types of graphs we actually have. 

We all must acknowledge the fact that actually there aren't any set rules around how a node should be connected to another node in a graph.

Edges can connect any two nodes in any way possible.

Before talking more about this, do we all appreciate that trees are nothing but just a more restricted version of graphs.

A tree will always be a graph, but not all graphs will be trees.
And if we remove all these rules that we impose on a tree, they are essentially graphs.




# Undirected graphs: Graphs with no direction

As we had discussed in the [previous lesson](https://www.educative.io/pageeditor/6586453712175104/6183745633124352/5973124278910976) about how we represent graphs, we had also touched a little bit on what types of graphs we actually have. 

We all must acknowledge the fact that actually there aren't any set rules around how a node should be connected to another node in a graph.

Edges can connect any two nodes in any way possible.

Before talking more about this, do we all appreciate that trees are nothing but just a more restricted version of graphs.

A tree will always be a graph, but not all graphs will be trees.
And if we remove all these rules that we impose on a tree, they are essentially graphs.




Learn what is directed and undirected graphs, why do we need such graphs, how we build such graphs and what are some real-life use cases of these types of graphs.

Flow

Graph Terminologies and Representations

Graph Traversals : Breadth - First Search

Graph Traversals : Depth - First Search

Topological Sorting

Cycle Detection : Directed and Undirected Graphs

Disjoint Set Structures : Union Find

Minimum Spanning Tree

Shortest Path Finding Algorithms

Articulation Points and Bridges

Biconnected Components

Strongly Connected Components

Eulerian Circuit

Bipartite Graphs

Important Graph Algorithms

Miscellaneous Problems: Intermediate and Advanced Levels

Introduction to Graphs

Undirected graphs: Graphs with no direction