Package com.google.common.graph
Class AbstractGraph<N>
java.lang.Object
com.google.common.graph.AbstractBaseGraph<N>
com.google.common.graph.AbstractGraph<N>
- Type Parameters:
N
- Node parameter type
- All Implemented Interfaces:
BaseGraph<N>
,Graph<N>
,PredecessorsFunction<N>
,SuccessorsFunction<N>
- Direct Known Subclasses:
ForwardingGraph
This class provides a skeletal implementation of
Graph
. It is recommended to extend this
class rather than implement Graph
directly.- Since:
- 20.0
-
Constructor Summary
Constructors -
Method Summary
Methods inherited from class com.google.common.graph.AbstractBaseGraph
degree, edgeCount, edges, hasEdgeConnecting, hasEdgeConnecting, incidentEdgeOrder, incidentEdges, inDegree, isOrderingCompatible, nodeInvalidatableSet, nodePairInvalidatableSet, outDegree, validateEndpoints
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface com.google.common.graph.Graph
adjacentNodes, allowsSelfLoops, degree, edges, hasEdgeConnecting, hasEdgeConnecting, incidentEdgeOrder, incidentEdges, inDegree, isDirected, nodeOrder, nodes, outDegree, predecessors, successors
-
Constructor Details
-
AbstractGraph
public AbstractGraph()
-
-
Method Details
-
equals
Description copied from interface:Graph
Returnstrue
iffobject
is aGraph
that has the same elements and the same structural relationships as those in this graph.Thus, two graphs A and B are equal if all of the following are true:
- A and B have equal
directedness
. - A and B have equal
node sets
. - A and B have equal
edge sets
.
Graph properties besides
directedness
do not affect equality. For example, two graphs may be considered equal even if one allows self-loops and the other doesn't. Additionally, the order in which nodes or edges are added to the graph, and the order in which they are iterated over, are irrelevant.A reference implementation of this is provided by
equals(Object)
. - A and B have equal
-
hashCode
public final int hashCode()Description copied from interface:Graph
Returns the hash code for this graph. The hash code of a graph is defined as the hash code of the set returned byGraph.edges()
.A reference implementation of this is provided by
hashCode()
. -
toString
Returns a string representation of this graph.
-