codeintuition-logo
Learning PathBlogsPremiumLogin
codeintuition-logo

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

Traversing a grid

Understanding traversal on grid
Understanding depth first search on a grid

Cycle detection

Detect cycle in a directed graph
Detect cycle in an undirected graph

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 maximum flow problem
Understanding the max flow min cut theorem
Find maximum flow

Maximum bipartite matching

Understanding maximum bipartite matching problem
Maximum bipartite matching

Pattern: Graph generator

Smallest multiple formation
Binary number generator

Pattern: Path finder

Source to target paths
Path validator

Pattern: Connected components

Connected components count
Path validator
Sum of minimums
Island count
Size of largest island

Pattern: Two colouring

Bipartite checker
Color a graph

Pattern: Shortest path (Breadth-first traversal)

Nearest distance
Minimum steps in a grid
Minimum steps in a grid II
Find transitive closure

Pattern: Shortest path (Dijkstra)

Minimum cost path
Shortest word transformation

Assessments

Assessment 1
Assessment 2

Certificate

Certificate

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

Subscribe now