Should return a sequence of NodeIdEdgesMaxId iterables
Define node numberer
The reader knows the format as it knows how to read the file.
The reader knows the format as it knows how to read the file. This reverse parses
the input n to a string in that same format.
Override to modify the graph's stored direction
Create an ArrayBasedDirectedGraph
Create an ArrayBasedDynamicDirectedGraph
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 anIteratoroverNodeIdEdgesMaxId(see its type signature below as well).It is also required to provide a
nodeNumberer[T].NodeIdEdgesMaxIdis a case class defined inArrayBasedDirectedGraphthat 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.