Comment by delhanty

For the vertex biconnected components can you say how your implementation compares technically with Boost Graph library's `biconnected_components` and `articulation_points`?

https://www.boost.org/library/latest/graph/

https://www.boost.org/doc/libs/latest/libs/graph/doc/biconne...

Am I correct to suppose both are C++ implementations of Tarjan's algorithm?