-
Notifications
You must be signed in to change notification settings - Fork 0
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.
ElhNour/TP2_TPGO_Articulation_point_problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
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 0
No packages published