Class GuavaNetworkAdapter<V,E>
- Type Parameters:
V
- the vertices typeE
- the edges type
- All Implemented Interfaces:
Network<V,
,E> PredecessorsFunction<V>
,SuccessorsFunction<V>
- Direct Known Subclasses:
GuavaMutableNetworkAdapter
The adapter is constructed with a JGAlgo graph and implements the Guava network interface, and can be used with any Guava algorithm. The adapter is a live view, so any change in the JGAlgo graph is reflected in the Guava network and vice versa, but the underlying JGAlgo graph should not be modified directly.
The Guava network is immutable, so as this adapter. A subclass of this
adapter, GuavaMutableNetworkAdapter
, is a mutable adapter that implements the
Guava mutable network interface.
The capabilities of the Guava network, such as parallel and self edges or whether the network is directed or undirected, are determined by the underlying JGAlgo graph.
Guava support different element orders for the nodes and the incident edges. This adapter uses the default element order, which is unordered, and cannot be changed as the underlying JGAlgo graph does not support any other order.
Among Guava Graph
, ValueGraph
and
Network
, the network is the most similar to JGAlgo graphs, as vertices and edges have
unique identifiers, and queries of edges are answered with the edges identifiers. On the other had, the Graph and
ValueGraph do not support unique identifiers for the edges, and operations on edges are addressed by a pair of nodes.
The ValueGraph does associate a value with each edge, be it does not have to be unique, and it is more similar to
weights in JGAlgo graphs.
For adapting the other way around, from Guava Network to JGAlgo, see GuavaNetworkWrapper
.
- Author:
- Barak Ugav
- See Also:
-
Constructor Summary
ConstructorDescriptionGuavaNetworkAdapter
(Graph<V, E> graph) Constructs a new adapter from the given JGAlgo graph. -
Method Summary
Modifier and TypeMethodDescriptionadjacentEdges
(E edge) adjacentNodes
(V node) boolean
boolean
edgeConnectingOrNull
(V nodeU, V nodeV) edges()
edgesConnecting
(V nodeU, V nodeV) boolean
hasEdgeConnecting
(EndpointPair<V> endpoints) boolean
hasEdgeConnecting
(V nodeU, V nodeV) incidentEdges
(V node) incidentNodes
(E edge) boolean
nodes()
predecessors
(V node) successors
(V node) Methods inherited from class com.google.common.graph.AbstractNetwork
asGraph, degree, edgeConnecting, edgeConnecting, edgeConnectingOrNull, edgesConnecting, equals, hashCode, inDegree, outDegree, toString
-
Constructor Details
-
GuavaNetworkAdapter
Constructs a new adapter from the given JGAlgo graph.- Parameters:
graph
- the JGAlgo graph
-
-
Method Details
-
nodes
-
edges
-
successors
-
predecessors
-
adjacentNodes
-
incidentEdges
-
inEdges
-
outEdges
-
incidentNodes
-
adjacentEdges
- Specified by:
adjacentEdges
in interfaceNetwork<V,
E> - Overrides:
adjacentEdges
in classAbstractNetwork<V,
E>
-
edgesConnecting
- Specified by:
edgesConnecting
in interfaceNetwork<V,
E> - Overrides:
edgesConnecting
in classAbstractNetwork<V,
E>
-
edgeConnectingOrNull
- Specified by:
edgeConnectingOrNull
in interfaceNetwork<V,
E> - Overrides:
edgeConnectingOrNull
in classAbstractNetwork<V,
E>
-
hasEdgeConnecting
- Specified by:
hasEdgeConnecting
in interfaceNetwork<V,
E> - Overrides:
hasEdgeConnecting
in classAbstractNetwork<V,
E>
-
hasEdgeConnecting
- Specified by:
hasEdgeConnecting
in interfaceNetwork<V,
E> - Overrides:
hasEdgeConnecting
in classAbstractNetwork<V,
E>
-
isDirected
public boolean isDirected() -
allowsParallelEdges
public boolean allowsParallelEdges() -
allowsSelfLoops
public boolean allowsSelfLoops() -
nodeOrder
-
edgeOrder
-