Uses of Interface
com.google.common.graph.Graph

Packages that use Graph

Package	Description
com.google.common.graph	An API for representing graph (node and edge) data.

Uses of Graph in com.google.common.graph

Subinterfaces of Graph in com.google.common.graph

Modifier and Type	Interface and Description
interface	MutableGraph<N> A subinterface of Graph which adds mutation methods.
interface	MutableValueGraph<N,V> A subinterface of ValueGraph which adds mutation methods.
interface	ValueGraph<N,V> An interface for graph- structured data, whose edges have associated non-unique values.

Classes in com.google.common.graph that implement Graph

Modifier and Type	Class and Description
class	AbstractGraph<N> This class provides a skeletal implementation of Graph.
class	AbstractValueGraph<N,V> This class provides a skeletal implementation of ValueGraph.
class	ImmutableGraph<N> A Graph whose elements and structural relationships will never change.
class	ImmutableValueGraph<N,V> A ValueGraph whose elements and structural relationships will never change.

Methods in com.google.common.graph that return Graph

Modifier and Type	Method and Description
Graph<N>	AbstractNetwork.asGraph()
Graph<N>	Network.asGraph() Returns a live view of this network as a Graph.
static <N> Graph<N>	Graphs.transitiveClosure(Graph<N> graph) Returns the transitive closure of graph.
static <N> Graph<N>	Graphs.transpose(Graph<N> graph) Returns a view of graph with the direction (if any) of every edge reversed.

Methods in com.google.common.graph with parameters of type Graph

Modifier and Type	Method and Description
static <N> ImmutableGraph<N>	ImmutableGraph.copyOf(Graph<N> graph) Returns an immutable copy of graph.
static <N> MutableGraph<N>	Graphs.copyOf(Graph<N> graph) Creates a mutable copy of graph with the same nodes and edges.
static boolean	Graphs.equivalent(Graph<?> graphA, Graph<?> graphB) Returns true if graphA and graphB have the same elements and the same relationships between elements, as exposed via the Graph interface.
static boolean	Graphs.equivalent(Graph<?> graphA, Graph<?> graphB) Returns true if graphA and graphB have the same elements and the same relationships between elements, as exposed via the Graph interface.
static <N> ValueGraphBuilder<N,Object>	ValueGraphBuilder.from(Graph<N> graph) Returns a ValueGraphBuilder initialized with all properties queryable from graph.
static <N> GraphBuilder<N>	GraphBuilder.from(Graph<N> graph) Returns a GraphBuilder initialized with all properties queryable from graph.
static boolean	Graphs.hasCycle(Graph<?> graph) Returns true if graph has at least one cycle.
static <N> MutableGraph<N>	Graphs.inducedSubgraph(Graph<N> graph, Iterable<? extends N> nodes) Returns the subgraph of graph induced by nodes.
static <N> Set<N>	Graphs.reachableNodes(Graph<N> graph, Object node) Returns the set of nodes that are reachable from node.
static <N> Graph<N>	Graphs.transitiveClosure(Graph<N> graph) Returns the transitive closure of graph.
static <N> Graph<N>	Graphs.transpose(Graph<N> graph) Returns a view of graph with the direction (if any) of every edge reversed.