Learning Path
Blogs
Premium
Login
Send
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
Creation
Clone adjacency list
Adjacency list to adjacency matrix
Adjacency matrix to adjacency list
Pattern: Depth first search
Perform depth first search
Path validator
Source to target paths
Pattern: Connected components
Connected components count
Island count
Size of largest island
Sum of minimums
Pattern: Breadth first search
Perform breadth first search
Nearest distance
Minimum steps in a grid
Minimum steps in a grid II
Shortest word transformation
Pattern: Cycle detection
Detect cycle
Detect cycle II
Pattern: Flyod warshell
Flyod warshall’s algorithm
Find transitive closure
Pattern: Graph coloring
Bipartite checker
Color a graph
Pattern: Ford fulkerson
Maximum bipartite matching
Find maximum flow
Pattern: Dijikstra
Dijikstra’s algorithm
Minimum cost path
Pattern: Bellman ford
Belman ford algorithm
Pattern: Topological sort
Perform topological sort
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
Liking the course? Start a
FREE
trial to continue learning.
Start free trial