Connected Components

article
10 min
Graph Fundamentals

Unlock this chapter

Access all lessons in Graph Fundamentals

Cost: 5 credits · One-time unlock

Sign in to unlock with credits

Sign In

New users get 1,000 free credits

Trees & Graphs All →
Binary Trees
Introduction to Trees Binary Tree Traversals Binary Search Trees Tree Height and Depth
Graph Fundamentals
Graph Representation BFS - Breadth First Search DFS - Depth First Search Connected Components
Advanced Graph Algorithms
Shortest Path - Dijkstra Topological Sort Cycle Detection
Previous
DFS - Depth First Search
Next
Shortest Path - Dijkstra