-
Notifications
You must be signed in to change notification settings - Fork 59
Open
Description
I should look into this properly, but just to get something down:
As far as I recall, we can check whether a graph is Biconnected and even k-connected (strongly? weakly?) but we can't necessarily get its biconnected or k-connected components. Is this something we can do, either quickly by a call to an existing function, or with significant new code?
I thought of this because of this.
Metadata
Metadata
Assignees
Labels
No labels