Learn Graph with visual DSA lessons

Learn Graph with 7 DSA patterns and 45 visual lessons. Follow step-by-step animations and synced C#, Python, and Java code.

A graph is a set of nodes connected by edges.

BFS (Unweighted Path)

Use a queue to expand outward one edge-distance level at a time.

Explore one path completely before returning to another neighbor.

Flood Fill Easy · Visible frontier and visited order
Number of Islands Medium · Visible frontier and visited order
All paths from source to target Medium · Visible frontier and visited order
Find Eventual Safe States Medium · Visible frontier and visited order
Count Components in Graph Medium · Visible frontier and visited order
Surrounded Regions Medium · Visible frontier and visited order
Is Graph Bipartite Medium · Visible frontier and visited order
Directed Cycle Detection Medium · Visible frontier and visited order
Undirected Cycle Detection Medium · Visible frontier and visited order
Longest Cycle in a Graph Hard · Visible frontier and visited order
Articulation Points Hard · Visible frontier and visited order
Bridges in Graph / Critical Connections Hard · Visible frontier and visited order

Order nodes so every prerequisite appears before the work depending on it.

Connect every node with minimum total cost and no unnecessary cycle.

Minimum spanning Tree Medium · Visible frontier and visited order
Kruskal’s algorithm Medium · Visible frontier and visited order
Lexicographically Smallest Equivalent String Medium · Visible frontier and visited order
Number of Connected Components in Graph Medium · Visible frontier and visited order
Redundant Connection Medium · Visible frontier and visited order
Connecting Cities With Minimum Cost Medium · Visible frontier and visited order
Accounts Merge Medium · Visible frontier and visited order

Use a min-priority queue to expand the cheapest known path.

Relax every edge repeatedly, even when weights can be negative.

Improve every source-to-destination pair through each possible middle node.

Transitive Closure Medium · Visible frontier and visited order
All-Pairs Shortest Path Medium · Visible frontier and visited order
Detect Negative Cycle Using Floyd-Warshall Medium · Visible frontier and visited order