Hide Index
Graph
0% completed
Introduction to graphs
Adjacency matrix representation
Adjacency list representation
Traversing a graph
Traversing a grid
Cycle detection
Topological sort
Single source shortest path
All pairs shortest path
Max-flow Min-cut theoram
Maximum bipartite matching
Pattern: Depth-first search
Pattern: Connected components
Pattern: Two colouring
Pattern: Shortest path (Breadth first search)
Pattern: Shortest path (Dijkstra)
Certificate
Enhanced implementation techniques
An adjacency matrix is an easy and effective way to implement a graph in memory. However, it is not the best way to do it. Some graphs cannot be implemented using the basic boolean matrix implementation.
Adjacency matrix implementation cannot store:
- Weighted edges
- Data value at nodes
Loading Image
Adjacency matrix cannot store graphs with edge weights and node data
Liking the course? Check our discounted plans to continue learning.