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 traversal
Implement depth first traversal
Understanding breadth first traversal
Implement breadth first traversal

Traversing a grid

Understanding traversal on grid
Understanding depth first traversal on a grid
Implement depth first traversal on a grid
Understanding breadth first traversal on a grid
Implement breadth first traversal on a grid

Cycle detection

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

Topological sort

Understanding topological sort
Understanding the topological sort algorithm
Implement topological sort
Implement topological sort II

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

Max-flow Min-cut theoram

Understanding the maximum flow problem
Understanding the max flow min cut theorem
Understanding the Ford-Fulkerson method
Understanding reverse edges in Ford-Fulkerson method
Find maximum flow

Maximum bipartite matching

Understanding maximum bipartite matching problem
Understanding the solution to maximum bipartite matching
Maximum bipartite matching
Maximum bipartite matching II

Pattern: Connected components

Understanding the connected component pattern
Identifying the connected component pattern
Find connected components
Sum of minimums
Island count
Size of largest island

Pattern: Two colouring

Understanding the two coloring pattern
Identifying the two coloring pattern
Dislike pairs
Two colourable

Pattern: All-paths aggregation

Understanding the all-paths aggregation pattern
Identifying the all-paths aggregation pattern
Source to target paths

Pattern: Shortest path (Breadth first search)

Identifying breadth-first search
Minimum steps in a grid
Nearest distance
Shortest word transformation
Minimum steps in a grid II

Pattern: Shortest path (Dijkstra)

Identifying Dijkstra's algorithm for shortest path
Minimum cost path

Assessments

Assessment 1
Assessment 2

Certificate

Certificate

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

Subscribe now