LogicalGraphExtension<V, E> extension
Methods
-
complement({bool allowSelfLoops = false, E? edge(V source, V target)?})
→ Graph<V, E>
-
Returns the complement of this graph, that is a graph with the same
vertices but with edges between vertices that had no edge.
-
intersection(Graph<V, E> other, {bool edgeCompare(V source, V target, E a, E b)?, E edgeMerge(V source, V target, E a, E b)?})
→ Graph<V, E>
-
Returns the intersection of this graph and
other. This is a graph with
the nodes and edges present in both graphs. edgeMerge specifies
how parallel edges are merged, if unspecified the last one is used.
-
union(Graph<V, E> other, {E edgeMerge(V source, V target, E a, E b)?})
→ Graph<V, E>
-
Returns the union of this graph and
other. This is a graph with the
nodes and edges present in either of the two graphs. edgeMerge specifies
how parallel edges are merged, if unspecified the last one is used.
Static Methods
-
unionAll<V, E>(Graph<V, E> result, Iterable<Graph<V, E>> others, {E edgeMerge(V source, V target, E a, E b)?})
→ void
-
Merges
others into result. edgeMerge specifies how parallel edges
are merged, if unspecified the last one is used.
