Skip to content

The problem is to find the points of articulation of a graph. An articulation point of a graph is a vertex such that if we remove it, we increase the number of connected components. The DFS algorithm is used to solve this problem.

Notifications You must be signed in to change notification settings

ElhNour/TP2_TPGO_Articulation_point_problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 

About

The problem is to find the points of articulation of a graph. An articulation point of a graph is a vertex such that if we remove it, we increase the number of connected components. The DFS algorithm is used to solve this problem.

Topics

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published