Professional Documents
Culture Documents
Tutorial Week-10 Set-2 Solution
Tutorial Week-10 Set-2 Solution
CO-Mapping
CO1 CO2 CO3
Q1 √
Q2 √
Q3 √
Objectives
1. Students will be able to learn how to find the topological sorting of a
graph.
2. Students will be able to learn how to apply DFS to get the number of
connected components in a graph.
3. Students will be able to learn how to apply DFS to find the articulation
points in a graph (Tarjan’s Algorithm).
Q3. Find the articulation points in the given graph using Tarjan’s Algorithm
Solution:
Steps of Tarjan’s Algorithm to find articulation points:
[Step 1.] Find the depth-first spanning tree T for G
[Step 2.] Add back edges in T
School of Computer Science Engineering and Technology
Articulation points: A, H, G, J