Represents the maximum flow through edges of a graph as computed by maximumFlow.
Inheritance Hierarchy
MaximumFlowResult
Remarks
This class cannot be instantiated
Type Details
- yFiles module
- view-layout-bridge
Properties
Gets a mapping from each edge to its flow.
Gets a collection of edges in the minimum cut.
Remarks
The minimum cut is a set of edges separating the graph into two partitions: The sourcePartition which contains the sources, and the sinkPartition containing the sinks. The total flow over those edges represents the maximumFlow and removing those edges will completely separate the sources from the sinks, making the maximum possible flow 0.
Gets a collection of the nodes which are at the sink side of the minimumCut.
Remarks
The minimum cut is a set of edges separating the graph into two partitions: The sourcePartition which contains the sources, and the sinkPartition containing the sinks. The total flow over those edges represents the maximumFlow and removing those edges will completely separate the sources from the sinks, making the maximum possible flow 0.
Gets a collection of the nodes which are on the source side of the minimumCut.
Remarks
The minimum cut is a set of edges separating the graph into two partitions: The sourcePartition which contains the sources, and the sinkPartition containing the sinks. The total flow over those edges represents the maximumFlow and removing those edges will completely separate the sources from the sinks, making the maximum possible flow 0.