edges property

List<Edge<V, E>> edges

Returns an iterable over the edges that are cut.

Each undirected edge appears for each direction once, to de-duplicate use minCut.edges.unique().

Implementation

late final List<Edge<V, E>> edges = graph.edges
    .where((edge) =>
        _bestPartition.contains(edge.source) !=
        _bestPartition.contains(edge.target))
    .toList();