Competitive Programming templates that I used during the past few years.
hashing
algorithms
string
matching
graphs
competitive-programming
data-structures
fft
dijkstra
dynamic-programming
biginteger
recurrence
algorithms-implemented
segment-tree
disjoint-sets
lca
floyd-warshall
matrix-exponentiation
bellman-ford-algorithm
bipartite-graphs
-
Updated
Dec 23, 2019 - C++
This algorithm is simple and it would be a nice addition to a collection algorithms your library provides
Documentation and sample Python code can be found here
https://www.geeksforgeeks.org/articulation-points-or-cut-vertices-in-a-graph/