feat(Combinatorics/Graph): Edge cut of Graph#37865
Conversation
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
PR summary 2a556ee342Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
This PR/issue depends on: |
This PR introduces
edgeCut: A function on set of vertices that returns the set of edges with exactly one end in the set.IsEdgeCut: A predicate for set of edges that promises it isedgeCutof some set.IsBridge: An edgeeis a bridge iff it is a singleton edge cut.IsBond: An edge SetBis bond iff it is minimal nonempty edge cut.