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

Creation

Clone adjacency list

Adjacency list to adjacency matrix

Adjacency matrix to adjacency list

Pattern: Depth first search

Understanding depth first search

Perform depth first search

Source to target paths

Pattern: Breadth first search

Understanding breadth first search

Perform breadth first search

Nearest distance

Minimum steps in a grid

Minimum steps in a grid II

Shortest word transformation

Pattern: Connected components

Connected components count

Size of largest island

Sum of minimums

Pattern: Cycle detection

Detect cycle II

Pattern: Dijikstra

Dijikstra’s algorithm

Minimum cost path

Pattern: Bellman ford

Belman ford algorithm

Pattern: Flyod warshell

Flyod warshall’s algorithm

Find transitive closure

Pattern: Topological sort

Perform topological sort

Pattern: Graph coloring

Bipartite checker

Pattern: Ford fulkerson

Maximum bipartite matching

Find maximum flow

Assessments

Certificate

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