[feature request] Implement 2-edge-connected components
As recommended, I am opening an issue suggesting the addition of an algorithm that labels the 2-edge-connected components of an undirected graph.
Cheers, Andre.
Edited by Tiago Peixoto
Please use the issue tracker only to report bugs (i.e. errors in the library that need to be fixed) or feature requests.
Please check if the current git version also has the same problem. An easy way to do this is to use google colab!
For questions about how to compile, install or use the library, please use instead the web forum at https://forum.skewed.de/c/graph-tool.
(If unsure, use the forum first.)
IMPORTANT: When opening new issues, please choose the BUG template from the drop-down menu, and fill out the required information.
As recommended, I am opening an issue suggesting the addition of an algorithm that labels the 2-edge-connected components of an undirected graph.
Cheers, Andre.