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

Packages that use Network

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

Uses of Network in com.google.common.graph

Subinterfaces of Network in com.google.common.graph

Modifier and Type	Interface and Description
interface	MutableNetwork<N,E> A subinterface of Network which adds mutation methods.

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

Modifier and Type	Class and Description
class	AbstractNetwork<N,E> This class provides a skeletal implementation of Network.
class	ImmutableNetwork<N,E> A Network whose elements and structural relationships will never change.

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

Modifier and Type	Method and Description
static <N,E> Network<N,E>	Graphs.transpose(Network<N,E> network) Returns a view of network with the direction (if any) of every edge reversed.

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

Modifier and Type	Method and Description
static <N,E> ImmutableNetwork<N,E>	ImmutableNetwork.copyOf(Network<N,E> network) Returns an immutable copy of network.
static <N,E> MutableNetwork<N,E>	Graphs.copyOf(Network<N,E> network) Creates a mutable copy of network with the same nodes and edges.
static boolean	Graphs.equivalent(Network<?,?> networkA, Network<?,?> networkB) Returns true if networkA and networkB have the same elements and the same relationships between elements, as exposed via the Network interface.
static boolean	Graphs.equivalent(Network<?,?> networkA, Network<?,?> networkB) Returns true if networkA and networkB have the same elements and the same relationships between elements, as exposed via the Network interface.
static <N,E> NetworkBuilder<N,E>	NetworkBuilder.from(Network<N,E> network) Returns a NetworkBuilder initialized with all properties queryable from network.
static boolean	Graphs.hasCycle(Network<?,?> network) Returns true if network has at least one cycle.
static <N,E> MutableNetwork<N,E>	Graphs.inducedSubgraph(Network<N,E> network, Iterable<? extends N> nodes) Returns the subgraph of network induced by nodes.
static <N,E> Network<N,E>	Graphs.transpose(Network<N,E> network) Returns a view of network with the direction (if any) of every edge reversed.