Finds the bi-connected components of an undirected connected graph. It first finds the articulation points of the graph. Then it disconnects the graph on each articulation point and computes the connected components.
- Packagefgl-5.8.3.1
- Exports1
- LanguageHaskell98
- LicenceBSD-3-Clause
- SourceBCC.hs