ForwardingGraph<V, E> class
Graph that forwards to a delegate implementation.
- Inheritance
- Available Extensions
- AlgorithmsGraphExtension
- BreadthFirstGraphExtension
- ConnectedGraphExtension
- CopyGraphExtension
- DepthFirstGraphExtension
- DepthFirstPostOrderGraphExtension
- ExportGraphExtension
- LogicalGraphExtension
- MapGraphExtension
- RandomWalkGraphExtension
- ReversedGraphExtension
- TopologicalGraphExtension
- UnmodifiableGraphExtension
- WhereGraphExtension
Constructors
-
ForwardingGraph(Graph<
V, E> delegate)
Properties
- defaultToStringPrinter → ObjectPrinter
-
Override to configure the empty ObjectPrinter.
no setterinherited
-
delegate
→ Graph<
V, E> -
final
-
edges
→ Iterable<
Edge< V, E> > -
Returns the edges of this graph.
no setteroverride
- hashCode → int
-
The hash code for this object.
no setterinherited
- isDirected → bool
-
Returns
true, if the graph is directed.no setteroverride - isUnmodifiable → bool
-
Returns
true, if the graph is unmodifiable.no setteroverride - runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
- toStringPrinter → ObjectPrinter
-
Override and call super to add values to the ObjectPrinter.
no setterinherited
-
vertexStrategy
→ StorageStrategy<
V> -
Returns a strategy to store vertices.
no setteroverride
-
vertices
→ Iterable<
V> -
Returns the vertices of this graph.
no setteroverride
Methods
-
addEdge(
V source, V target, {E? value}) → void -
Adds an edge between
sourceandtargetvertex. Optionally associates the providedvaluewith the edge. If the edge already exists, replaces the existing edge data.override -
addVertex(
V vertex) → void -
Adds a
vertexto this graph.override -
edgesOf(
V vertex) → Iterable< Edge< V, E> > -
Returns the incoming and outgoing edges of
vertex.override -
getEdge(
V source, V target) → Edge< V, E> ? -
Returns the edge between
sourceandtarget, ornull.override -
incomingEdgesOf(
V vertex) → Iterable< Edge< V, E> > -
Returns the incoming edges of
vertex.override -
neighboursOf(
V vertex) → Iterable< V> -
Returns the vertices that are adjacent to a
vertex.override -
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
outgoingEdgesOf(
V vertex) → Iterable< Edge< V, E> > -
Returns the outgoing edges of
vertex.override -
predecessorsOf(
V vertex) → Iterable< V> -
Returns the vertices that come before a
vertex.override -
putEdge(
V source, V target, E ifAbsent()) → E -
Look up the value of the edge between
sourceandtarget, or add a new edge with the value ofifAbsentif it isn't there.inherited -
removeEdge(
V source, V target) → void -
Removes an edge between
sourceandtargetfrom this graph.override -
removeVertex(
V vertex) → void -
Removes a
vertexfrom this graph.override -
successorsOf(
V vertex) → Iterable< V> -
Returns the vertices that come after a
vertex.override -
toString(
) → String -
Standard
toStringimplementation. Do not override, instead implement toStringPrinter to customize.inherited
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited