@dxzmpk/js-algorithms-data-structures/src/algorithms/graph/articulation-points/README.md

Algorithms and data-structures implemented on JavaScript

# Articulation Points (or Cut Vertices)

A vertex in an undirected connected graph is an articulation point
(or cut vertex) if removing it (and edges through it) disconnects 
the graph. Articulation points represent vulnerabilities in a 
connected network – single points whose failure would split the 
network into 2 or more disconnected components. They are useful for 
designing reliable networks.

For a disconnected undirected graph, an articulation point is a 
vertex removing which increases number of connected components.

![Articulation Points](https://www.geeksforgeeks.org/wp-content/uploads/ArticulationPoints.png)

![Articulation Points](https://www.geeksforgeeks.org/wp-content/uploads/ArticulationPoints1.png)

![Articulation Points](https://www.geeksforgeeks.org/wp-content/uploads/ArticulationPoints21.png)

## References

- [GeeksForGeeks](https://www.geeksforgeeks.org/articulation-points-or-cut-vertices-in-a-graph/)
- [YouTube](https://www.youtube.com/watch?v=2kREIkF9UAs&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)