- nodes
Returns all nodes in this graph, in the order specified by #nodeOrder().

- adjacentNodes
Returns the nodes which have an incident edge in common with node in this graph.

- edgeValue
Returns the value of the edge connecting nodeU to nodeV, if one is present;
otherwise, returns Optio

- edges
Returns all edges in this graph.

- allowsSelfLoops
Returns true if this graph allows self-loops (edges that connect a node to
itself). Attempting to ad

- outDegree
Returns the count of node's outgoing edges (equal to successors(node).size()) in
a directed graph. I

- degree
Returns the count of node's incident edges, counting self-loops twice
(equivalently, the number of t

- edgeValueOrDefault
Returns the value of the edge connecting nodeU to nodeV, if one is present;
otherwise, returns defau

- inDegree
Returns the count of node's incoming edges (equal to predecessors(node).size())
in a directed graph.

- isDirected
Returns true if the edges in this graph are directed. Directed edges connect a
EndpointPair#source()

- hasEdgeConnecting
Returns true if there is an edge directly connecting nodeU to nodeV. This is
equivalent to nodes().c

- nodeOrder
Returns the order of iteration for the elements of #nodes().