Reads <code>b.length</code> bytes from this file into the byte array. This method reads repeatedly from the file until all the bytes are read. This me

Enabled or disables the deterministic parallelism. It is enabled by default. See http://code.google.com/p/graphchi/wiki/IntroductionToGraphChi section

Adds a random walk job. Use run() to run all the jobs. @param edgeDirection which direction edges need to be considered @param callback your walk log

Add a set of walks from a source. Note, you must add the walks in sorted order! @param vertex source vertex @param numWalks @return

Moves walk to next vertex @param walk walk identified @param destinationVertex vertex id to move hte walk to @param trackBit set to true if this walk

Returns the current position in the file, where the next read or write will occur. @return the offset from the start of the file in bytes. @throws IO

@return the total number of vertices in the current graph

Returns the value of i'th outedge (short-cut to outEdge(i)->getValue()) @param i @return the value of i'th outedge (short-cut to outEdge(i)->getValue

Returns true if walk was started from the vertex

@param sourceId @param toVertex @param trackBit true if odd, false if even hop

@param sourceId @param toVertex @param trackBit true if odd, false if even hop

@return the number of in- and out-edges

Bit arithmetic for packing two 32-bit vertex-ids into one 64-bit long. @param a @param b @return

Queries out=neighbors for a given set of vertices. @param queryVertices @return

Randomize the content with numbers between from and to @param from min value @param to max value

You can instruct the engine to automatically ignore vertices that do not have any edges. By default this is <b>false</b>. @param skipZeroDegreeVertice

Called for every (scheduled) vertex @param vertex the current vertex @param context context representing the current state of the computation

Returns an iterator to vertices. Vertices are iterated in their internal-order, but the iterator elements have the original ids. @param numVertices nu

Writes a <code>byte</code> to the file as a 1-byte value. @param v a <code>byte</code> value to be written. @throws IOException if an I/O error occur

INTERNAL USE ONLY (TODO: separate better)

Close the file, and release any associated system resources. @throws IOException if an I/O error occurrs.

Copy the contents of the buffer to the disk. @throws IOException if an I/O error occurs.

Returns degree of a vertex. The vertex must be in the previous interval loaded using load(). @param vertexId id of the vertex @return VertexDegree ob

@return the total number of iterations

Returns whether vertex id is a source of random walks. @return

Compute a prediction. Note: need to use the internal vertex-ids. @param leftVertex (often "user") @param rightVertex (often "movie") @return

Read directly from file, without going through the buffer. All reading goes through here or readToByteChannel; @param pos start here in the file @

Recommend friends @param vertexId queryAndCombine vertex @param fanOut maximum of queryAndCombine vertex's friends to consider. Selected randomly. @t

Disable loading of out-edges @param disableOutEdges

Configures the maximum number of vertices loaded at any time. Default is 20 million. Generally you should not needed to modify this. @param maxWindow

Set the memorybudget in megabytes. Default is JVM's max memory / 4. Memory budget affects the number of vertices loaded into memory at any time. @para

Returns a sorted list of top topN vertices having float values. @param baseFilename input-graph @param numVertices number of vertices in the graph (us

Writes a <code>long</code> to the file as eight bytes, high byte first. @param v a <code>long</code> to be written. @throws IOException if an I/O err

INTERNAL USE ONLY (TODO: separate better)

Adds a vertex to schedule @param vertexId

Called when a new interval of vertices (corresponding to shards, see http://code.google.com/p/graphchi/wiki/IntroductionToGraphChi) is being processed

Called when a new iteration starts @param ctx

Called when a new sub-interval of vertices (see http://code.google.com/p/graphchi/wiki/IntroductionToGraphChi) is being processed. @param ctx @param i

Broadcasts a value to the neighbors by writing it to the out-edges

Compute ALS and return the ALS object which can be used to compute predictions. @param baseFilename @param nShards @param D @return @throws IOExceptio

Compute SALSA on graph initialized in initializeGraph() method. @param nIterations

Start walks from vertex firstSourceId to firstSourceId + numSources @param firstSourceId @param numSources how many walks to start from each source @

Configure walks starting from list of vertices @param walkSources @param walksPerSource

For definition of "memory shards", see http://code.google.com/p/graphchi/wiki/IntroductionToGraphChi @throws IOException

Initialize the sharder-program. @param graphName @param numShards @return @throws java.io.IOException