StoerWagnerMinCut<V, E> class
Stoer–Wagner minimum cut algorithm in O(VE + Vlog(V)).
See https://en.wikipedia.org/wiki/Stoer%E2%80%93Wagner_algorithm.
Constructors
-
StoerWagnerMinCut({required Graph<
V, E> graph, num edgeWeight(V source, V target)?, StorageStrategy<V> ? vertexStrategy})
Properties
-
edges
→ List<
Edge< V, E> > -
Returns an iterable over the edges that are cut.
latefinal
- edgeWeight → num Function(V source, V target)
-
The edge weight used to compute the cut.
final
-
graph
→ Graph<
V, E> -
The underlying graph on which this cut was computed.
final
-
graphs
→ List<
Graph< V, E> > -
Returns a list with the graphs on each side of the cut.
latefinal
- hashCode → int
-
The hash code for this object.
no setterinherited
- runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
-
vertexStrategy
→ StorageStrategy<
V> -
The vertex strategy to store vertices of type V.
final
- weight → num
-
Returns the weight of the cut vertices.
no setter
Methods
-
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
toString(
) → String -
A string representation of this object.
inherited
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited