Returns the total number of directed edges in the graph.
Returns the total number of directed edges in the graph. A mutual edge, eg: A -> B and B -> A, counts as 2 edges in this total.
Returns the node with the given id
or else None
if the given node does not
exist in this graph.
Returns the node with the given id
or else None
if the given node does not
exist in this graph.
Checks if the given graph dir is stored in this graph
Checks if the given graph dir is stored in this graph
the graph dir in question
if the current graph stores the query graph direction
The label of a node accessed by name.
The label of a node accessed by name. Label can be anything.
the max node id
the max node id
Returns the number of nodes in the graph.
Returns the number of nodes in the graph.
Labels on nodes of this graph.
Labels on nodes of this graph.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
the graph direction(s) stored
the graph direction(s) stored
Added default toString for debugging (prints max of 10 nodes)
Added default toString for debugging (prints max of 10 nodes)
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
This class is an implementation of the directed graph trait that is backed by an array The private constructor takes as its input a list of (@see Node) nodes, then stores nodes in an array. It also builds all edges which are also stored in array.