Retrieve biconnected components in terms of edges

[szhorvat]

What is the feature or improvement you would like to see?

Retrieve biconnected components in terms of edges instead of in terms of vertices.

Use cases for the feature

• This is already implemented in the C core
• Biconnected components can be thought of as a partitioning of the edge set. Each edge is part of precisely one component. In contrast a vertex may be part of more than one component.

Notes

It makes sense to think about whether EdgeClustering and EdgeCover objects make sense. Related: #507 (comment)

References

• https://igraph.readthedocs.io/en/stable/api/igraph.Graph.html#biconnected_components
• https://igraph.org/c/html/latest/igraph-Structural.html#igraph_biconnected_components

[MDK8888]

Hey, I would like to work on this issue!

[stale]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed in 14 days if no further activity occurs. Thank you for your contributions.