Returns the nodes which have an incident edge in common with node in this graph.
Returns true if this graph allows self-loops (edges that connect a node to
itself). Attempting to ad
Returns the count of node's incident edges, counting self-loops twice
(equivalently, the number of t
Returns true if there is an edge directly connecting nodeU to nodeV. This is
equivalent to nodes().c
Returns the count of node's incoming edges (equal to predecessors(node).size())
in a directed graph.
Returns true if the edges in this graph are directed. Directed edges connect a
Returns the order of iteration for the elements of #nodes().
Returns all nodes in this graph, in the order specified by #nodeOrder().
Returns the count of node's outgoing edges (equal to successors(node).size()) in
a directed graph. I