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

Single source shortest path

Understanding single source shortest path problem

Understanding Dijkstra's algorithm

Implementing Dijkastra's algorithm

Implement Dijikstra’s algorithm

Understanding negative weight edges

Understanding the Bellman-Ford algorithm

Implement Belman ford algorithm

All pairs shortest path

Understanding all-pair shortest path problem

Understanding Floyd-Warshall algorithm

Implement Flyod-Warshall algorithm

Topological sort

Perform topological sort

Max-flow Min-cut theoram

Understanding the max flow min cut theorem

Understanding the maximum flow problem

Find maximum flow

Maximum bipartite matching

Understanding maximum bipartite matching problem

Maximum bipartite matching

Pattern: Path finder

Source to target paths

Detect cycle II

Pattern: Two colouring

Bipartite checker

Pattern: Graph generator

Smallest multiple formation

Binary number generator

Pattern: Traversal on a grid

Nearest distance

Minimum steps in a grid

Minimum steps in a grid II

Pattern: Connected components

Connected components count

Sum of minimums

Size of largest island

Pattern: Shortest path applications

Find transitive closure

Minimum cost path

Shortest word transformation

Assessments

Certificate

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