Strongly connected components in Data Structures Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a strongly connected component (SCC) in a directed graph?

A strongly connected component is a part of a directed graph where every vertex is reachable from every other vertex within that part.

intermediate

Why are strongly connected components important in graph analysis?

They help identify clusters of nodes with mutual reachability, which is useful in understanding structure, detecting cycles, and simplifying graphs.

beginner

Name two common algorithms used to find strongly connected components.

Kosaraju's algorithm and Tarjan's algorithm are two popular methods to find strongly connected components efficiently.

intermediate

How does Kosaraju's algorithm find strongly connected components?

It performs a depth-first search (DFS) to order nodes by finish time, reverses the graph edges, then does DFS in that order to identify SCCs.

intermediate

What is the time complexity of Tarjan's algorithm for finding SCCs?

Tarjan's algorithm runs in linear time, O(V + E), where V is vertices and E is edges in the graph.

What does it mean if two nodes are in the same strongly connected component?

A They have the same number of edges.

B Each node can reach the other by following directed edges.

C They are connected by an undirected edge.

D They have no edges between them.

In a strongly connected component, every node is reachable from every other node following the direction of edges.

Which step is NOT part of Kosaraju's algorithm?

A Perform DFS on reversed graph in order of finish times.

B Reverse all edges in the graph.

C Perform DFS to get finish times.

D Sort nodes by degree.

Kosaraju's algorithm does not sort nodes by degree; it uses DFS and edge reversal.

What type of graph is required to find strongly connected components?

A Undirected graph.

B Weighted graph only.

C Directed graph.

D Tree graph.

Strongly connected components are defined only for directed graphs.

Tarjan's algorithm uses which data structure to track nodes during DFS?

A Stack.

B Queue.

C Priority queue.

D Hash map.

Tarjan's algorithm uses a stack to keep track of nodes in the current DFS path.

What is the main goal of finding strongly connected components in a graph?

A To group nodes where each can reach the other.

B To find the shortest path between nodes.

C To count the total number of edges.

D To convert the graph into a tree.

The goal is to find groups of nodes with mutual reachability.

Explain what a strongly connected component is and why it matters in analyzing directed graphs.

Think about groups of nodes where you can travel from any one to any other.

Describe the main steps of Kosaraju's algorithm for finding strongly connected components.

Focus on the order of DFS and the role of reversing edges.

Practice

1. What is a strongly connected component in a directed graph?

easy

A. A path from one node to another without cycles

B. A set of nodes with no edges between them

C. A subgraph with only one node and no edges

D. A group of nodes where each node can reach every other node in the group

Solution

1. Step 1: Understand the definition of strongly connected components

   Strongly connected components are groups of nodes in a directed graph where each node is reachable from every other node in the same group.

2. Step 2: Compare options with the definition

   A group of nodes where each node can reach every other node in the group matches this definition exactly, while others describe unrelated concepts.

3. Final Answer:

   A group of nodes where each node can reach every other node in the group -> Option D

4. Quick Check:

   Strong connectivity means mutual reachability [OK]

Hint: Strongly connected means all nodes reach each other [OK]

Common Mistakes:

• Confusing strongly connected with just connected
• Thinking it means no edges
• Assuming it applies to undirected graphs only

2. Which step is NOT part of Kosaraju's algorithm to find strongly connected components?

easy

A. Perform a BFS on the transposed graph to find components

B. Transpose the graph by reversing all edges

C. Perform a DFS on the original graph to get finishing times

D. Perform a DFS on the transposed graph in order of decreasing finishing times

Solution

1. Step 1: Recall Kosaraju's algorithm steps

   It involves two DFS passes and graph transposition. BFS is not used.

2. Step 2: Identify the incorrect step

   Perform a BFS on the transposed graph to find components mentions BFS on the transposed graph, which is not part of Kosaraju's algorithm.

3. Final Answer:

   Perform a BFS on the transposed graph to find components -> Option A

4. Quick Check:

   Kosaraju uses DFS, not BFS [OK]

Hint: Kosaraju uses DFS twice, not BFS [OK]

Common Mistakes:

• Mixing BFS with DFS in Kosaraju's algorithm
• Forgetting to transpose the graph
• Confusing order of DFS passes

3. Given the directed graph edges: 1->2, 2->3, 3->1, 3->4, how many strongly connected components does it have?

medium

A. 2

B. 1

C. 3

D. 4

Solution

1. Step 1: Identify cycles and connectivity

   Nodes 1, 2, and 3 form a cycle (each reachable from others). Node 4 has no outgoing edges and is separate.

2. Step 2: Count strongly connected components

   There are two components: {1,2,3} and {4}.

3. Final Answer:

   2 -> Option A

4. Quick Check:

   Cycle group + isolated node = 2 components [OK]

Hint: Cycle nodes form one component; isolated nodes separate [OK]

Common Mistakes:

• Counting each node as separate component
• Ignoring cycles
• Assuming node 4 connects back

4. In Kosaraju's algorithm, a student forgot to reverse the graph edges before the second DFS. What is the likely result?

medium

A. The algorithm will still find all strongly connected components correctly

B. The algorithm will find only one strongly connected component

C. The algorithm may fail to identify all strongly connected components

D. The algorithm will run infinitely

Solution

1. Step 1: Understand the role of graph transposition

   Reversing edges is crucial to explore components correctly in the second DFS.

2. Step 2: Predict the effect of skipping transposition

   Without reversing edges, the second DFS may miss some components or merge them incorrectly.

3. Final Answer:

   The algorithm may fail to identify all strongly connected components -> Option C

4. Quick Check:

   Missing transpose breaks component detection [OK]

Hint: Transpose graph before second DFS to find components [OK]

Common Mistakes:

• Assuming algorithm works without transposition
• Thinking it causes infinite loops
• Believing it finds only one component always

5. You have a directed graph representing web pages linking to each other. How can strongly connected components help improve web crawling?

hard

A. By removing all links to speed up crawling

B. By grouping pages that form cycles, allowing focused crawling within these groups

C. By converting the graph into an undirected graph for simpler traversal

D. By ignoring isolated pages to save resources

Solution

1. Step 1: Understand the meaning of strongly connected components in web graphs

   They identify groups of pages where each page links to others in the group, forming cycles.

2. Step 2: Apply this to web crawling strategy

   Grouping these pages allows crawlers to focus on tightly connected clusters, improving efficiency and coverage.

3. Final Answer:

   By grouping pages that form cycles, allowing focused crawling within these groups -> Option B

4. Quick Check:

   SCCs help cluster linked pages for efficient crawling [OK]

Hint: Use SCCs to find linked page clusters for crawling [OK]

Common Mistakes:

• Thinking SCCs remove links
• Confusing directed with undirected graphs
• Ignoring isolated pages is not always best