AdjacencyListGraphReader
Related Docs:
object AdjacencyListGraphReader
| package io
the directory to read from
the string that each part file starts with
nodeNumberer to use with node ids
function that can read id from String
the directory to read from
the directory to read from
Should return a sequence of NodeIdEdgesMaxId iterables
Should return a sequence of NodeIdEdgesMaxId iterables
nodeNumberer to use with node ids
nodeNumberer to use with node ids
Returns a reader for a given file (shard).
Returns a reader for a given file (shard).
the string that each part file starts with
the string that each part file starts with
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.
Separator between node ids forming edge.
Separator between node ids forming edge.
Override to modify the graph's stored direction
Override to modify the graph's stored direction
Create an ArrayBasedDirectedGraph
Create an ArrayBasedDirectedGraph
Create an ArrayBasedDynamicDirectedGraph
Create an ArrayBasedDynamicDirectedGraph
Reads in a multi-line adjacency list from multiple files in a directory, where ids are of type T. Does not check for duplicate edges or nodes.
You can optionally specify which files in a directory to read. For example, you may have files starting with "part-" that you'd like to read. Only these will be read in if you specify that as the file prefix.
In each file, a node and its neighbors is defined by the first line being that node's id and its # of neighbors, followed by that number of ids on subsequent lines. For example, when ids are Ints, 241 3 2 4 1 53 1 241 ... In this file, node 241 has 3 neighbors, namely 2, 4 and 1. Node 53 has 1 neighbor, 241.
Similarly, when ids are String, input file should follow the example: Alice 2 Bob Chris Bob 1 Chris Chris 1 Bob ... In this file Alice has 2 directed edges to Bob and Chris, Bob has an edge to Chris, and Chris has outgoing edge to Bob. *