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.
Describes whether the stored graph is only in-directions, out-directions or both
Describes whether the stored graph is only in-directions, out-directions or both
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.
A graph which reads edge data from a memory mapped file. There is no object overhead per node: the memory used for n nodes and m edges with both in-neighbor and out-neighbor access is exactly 16 + 16*n + 8*m bytes. Also, loading is very fast because no parsing of text is required. Loading time is exactly the time it takes the operating system to map data from disk into memory. Nodes are numbered sequentially from 0 to nodeCount - 1 and must be a range of this form (i.e. nodeCount == maxNodeId + 1).
When transforming a graph where nodeCount <= maxNodeId to this format, new nodes with no neighbors will be implicitly created. Currently only supports storing both in-neighbors and out-neighbors of nodes (StoredGraphDir.BothInOut). The binary format is currently subject to change. Node objects are created on demand when getNodeById is called.