Learning Path Blogs Premium Login

Hide Index

Graph

0% completed

Introduction to graphs

Understanding the problem

Exploring a possible solution

Graph terminologies

Types of graphs

Adjacency matrix representation

Structure of an adjacency matrix

Implementation of adjacency matrix

Enhanced implementation techniques

Adjacency list representation

Structure of adjacency list

Implementation of adjacency list

Enhanced implementation techniques

Clone adjacency list

Adjacency list to adjacency matrix

Adjacency matrix to adjacency list

Traversing a graph

Understanding depth first search

Perform depth first search

Understanding breadth first search

Perform breadth first search

Detecting cycle in a graph

Detect cycle II

Topological sort

Perform topological sort

Coloring a graph

Bipartite checker

Finding shortest path

Understanding single source shortest path problem

Implement Dijikstra’s algorithm

Minimum cost path

Understanding negative weight edges

Implement Belman ford algorithm

Understanding all-pair shortest path problem

Implement Flyod-Warshall algorithm

Find transitive closure

Maximum bipartite matching

Understanding maximum bipartite matching problem

Maximum bipartite matching

Max-flow Min-cut theoram

Understanding the max flow min cut theorem

Understanding the maximum flow problem

Find maximum flow

Pattern: Depth first search

Source to target paths

Pattern: Breadth first search

Smallest multiple formation

Binary number generator

Nearest distance

Minimum steps in a grid

Minimum steps in a grid II

Shortest word transformation

Pattern: Connected components

Connected components count

Sum of minimums

Size of largest island

Assessments

Certificate

Liking the course? Check our discounted plans to continue learning.