pub struct StCuts {
pub cuts: Vec<Vec<EdgeId>>,
pub partition1s: Vec<Vec<VertexId>>,
}Expand description
All minimal s-t edge cuts of a directed graph, see Graph::all_st_cuts.
Fields§
§cuts: Vec<Vec<EdgeId>>Every minimal cut, as a list of edge ids.
partition1s: Vec<Vec<VertexId>>For each cut, the vertex set X generating it: the cut consists of
all edges from X to its complement. X contains the source.
Trait Implementations§
impl StructuralPartialEq for StCuts
Auto Trait Implementations§
impl Freeze for StCuts
impl RefUnwindSafe for StCuts
impl Send for StCuts
impl Sync for StCuts
impl Unpin for StCuts
impl UnsafeUnpin for StCuts
impl UnwindSafe for StCuts
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more