Package | Description |
---|---|
com.google.common.graph |
An API for representing graph (node and edge) data.
|
Modifier and Type | Interface and Description |
---|---|
interface |
MutableValueGraph<N,V>
A subinterface of
ValueGraph which adds mutation methods. |
Modifier and Type | Class and Description |
---|---|
class |
AbstractValueGraph<N,V>
This class provides a skeletal implementation of
ValueGraph . |
class |
ImmutableValueGraph<N,V>
A
ValueGraph whose elements and structural relationships will never change. |
Modifier and Type | Method and Description |
---|---|
static <N,V> ValueGraph<N,V> |
Graphs.transpose(ValueGraph<N,V> graph)
Returns a view of
graph with the direction (if any) of every edge reversed. |
Modifier and Type | Method and Description |
---|---|
static <N,V> ImmutableValueGraph<N,V> |
ImmutableValueGraph.copyOf(ValueGraph<N,V> graph)
Returns an immutable copy of
graph . |
static <N,V> MutableValueGraph<N,V> |
Graphs.copyOf(ValueGraph<N,V> graph)
Creates a mutable copy of
graph with the same nodes, edges, and edge values. |
static boolean |
Graphs.equivalent(ValueGraph<?,?> graphA,
ValueGraph<?,?> graphB)
Returns
true if graphA and graphB have the same elements (including
edge values) and the same relationships between elements, as exposed via the ValueGraph
interface. |
static boolean |
Graphs.equivalent(ValueGraph<?,?> graphA,
ValueGraph<?,?> graphB)
Returns
true if graphA and graphB have the same elements (including
edge values) and the same relationships between elements, as exposed via the ValueGraph
interface. |
static <N,V> MutableValueGraph<N,V> |
Graphs.inducedSubgraph(ValueGraph<N,V> graph,
Iterable<? extends N> nodes)
Returns the subgraph of
graph induced by nodes . |
static <N,V> ValueGraph<N,V> |
Graphs.transpose(ValueGraph<N,V> graph)
Returns a view of
graph with the direction (if any) of every edge reversed. |
Copyright © 2010-2017. All Rights Reserved.