- Common ways to obtain ValueGraph

private void myMethod () {}

@Override public boolean equals(Object o) { if (this == o) { return true; } if (!(o instanceof IntermediateComputationResult)) { return false; } IntermediateComputationResult other = (IntermediateComputationResult) o; return _bgpTopology.equals(other._bgpTopology); }

## Javadoc

Returns
true iff
object is a
ValueGraph that has the same elements and
the same structural relationships as those in this graph.

Thus, two value graphs A and B are equal if **all** of the following are true:

- A and B have equal #isDirected().
- A and B have equal #nodes().
- A and B have equal #edges().
- The #edgeValue(Object,Object) of a given edge is the same in both A and B.

Graph properties besides
#isDirected() 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 AbstractValueGraph#equals(Object).

## Popular methods of ValueGraph

- nodesReturns all nodes in this graph, in the order specified by #nodeOrder().
- adjacentNodesReturns the nodes which have an incident edge in common with node in this graph.
- edgeValueReturns the value of the edge connecting nodeU to nodeV, if one is present; otherwise, returns Optio
- edgesReturns all edges in this graph.
- allowsSelfLoopsReturns true if this graph allows self-loops (edges that connect a node to itself). Attempting to ad
- outDegreeReturns the count of node's outgoing edges (equal to successors(node).size()) in a directed graph. I
- degreeReturns the count of node's incident edges, counting self-loops twice (equivalently, the number of t
- edgeValueOrDefaultReturns the value of the edge connecting nodeU to nodeV, if one is present; otherwise, returns defau
- inDegreeReturns the count of node's incoming edges (equal to predecessors(node).size()) in a directed graph.
- isDirectedReturns true if the edges in this graph are directed. Directed edges connect a EndpointPair#source()
- hasEdgeConnectingReturns true if there is an edge directly connecting nodeU to nodeV. This is equivalent to nodes().c
- nodeOrderReturns the order of iteration for the elements of #nodes().

## Popular in Java

- Parsing JSON documents to java classes using gson
- setScale (BigDecimal)
- onRequestPermissionsResult (Fragment)
- putExtra (Intent)
- Rectangle (java.awt)A Rectangle specifies an area in a coordinate space that is enclosed by the Rectangle object's top-
- TreeMap (java.util)A Red-Black tree based NavigableMap implementation. The map is sorted according to the Comparable of
- Executors (java.util.concurrent)Factory and utility methods for Executor, ExecutorService, ScheduledExecutorService, ThreadFactory,
- Pattern (java.util.regex)A compiled representation of a regular expression. A regular expression, specified as a string, must
- Notification (javax.management)
- DateTimeFormat (org.joda.time.format)Factory that creates instances of DateTimeFormatter from patterns and styles. Datetime formatting i