Should return a sequence of iterators over NodeIdEdgesMaxId
objects
Define node numberer
Override to use multiple threads
Override to modify the graph's stored direction
Create an ArrayBasedDirectedGraph
Create a SharedArrayBasedDirectedGraph
Create a SharedArrayBasedDirectedGraph
Number of shards to split the in-memory array into 128 is an arbitrary default
Trait that classes should implement to read in graphs that nodes have ids of type
T
.The reader class is required to implement
iteratorSeq
, a method which returns a sequence of functions that themselves return anIterator
overNodeIdEdgesMaxId
(see its type signature below as well).It is also required to provide a
nodeNumberer[T]
.NodeIdEdgesMaxId
is a case class defined inArrayBasedDirectedGraph
that stores 1) the id of a node, 2) the ids of its neighbors, and 3) the maximum id of itself and its neighbors.One useful reference implementation is
AdjacencyListGraphReader
.