Based on community of each of its neighbors, each vertex determimnes if it should retain its currenty community or swtich to a neighboring communinity

determine the change in q if a node were to move to the given community. @param currCommunityId @param testCommunityId @param testSigmaTotal @param e

Find the number of changes in the high betweenness set. Compares the previous run to the newest computation. @param incomingSet A new set of high bet

Each vertex will recieve its own communities sigma_total (if updated), and then send its currenty community info to each of its neighbors. @param mes

Return the current global state @return State that stores the current global state

Gets the distance from source to a predecessor. @return The distance value.

The implementing classes must convert their Writable object into a String that can be appended to the String of text that will become our Text output

@return the ids of the stored items, as a set.

@return the maxSize of this list.

Get a new HighBetweennessList object, configured with the betweenness.set.maxSize option from the job conf. If not set size will default to 1. @param

Get a new PathData message for sending successor / predecessor information to neighbors @param source The source that the ping came from. @return A n

@return the priority queue backing this list.

Gets a Random Object With A possible Seed based on a Configuration. @param name Configuration Key @return Random which is either seeded or not.

Gets the number of successors that need to be processed. @return The successors value.

The implementing classes must convert their Writable object into a String that can be appended to the String of text that will become our Text output

Determines if a vertex can be a pivot point. @param id Vertex Id @return True if it is a pivot point.

Saves a file in the hdfs output dir to make that computation is complete. Writes final q value to the file. @param message

Replace each edge to a neighbor with an edge to that neigbors community instead. Done just before exiting computation. In the next state of the piple

Inform each node we are connected to if we only have one edge so that we can be purged from the graph, or vote to halt @param vertex The current vert

Sets the dependency value. @param dependency The value to set dependency to.

Sets the distance from a source to this vertex. @param distance The distance to set it to.

Sets the distance from a source to a predecessor. @param distance Distance value to set it to.

Sets the value of from. @param from The value to set from to.

Sets the Predecessor Path Count Map. @param predPathCountMap The Map to set it to.

Update This shortest path list based on a new shortest path message @param data A new path data message. @return true if the ShortestPathList is modi

Each community hub aggregates the values from each of its members to update the node's sigma total, and then sends this back to each of its members.

Write the high betweenness set to a file in hdfs @param set A set of vertices that contain the highest highbetweenness value.

Writes the various statistics when computation finishes.

Constructor for a New BcTuple @param id Vertex Id @param value Betweenness Value

Creates a new HighBetweennessList with Max size 1.

Default Constructor for a PartialDependency. Dependency and Successors are both set to 0.

The Default Constructor for PathData: <ul> <li>Sets Distance to the Max long value.</li> <li>Sets source to -1.</li> <li>Sets from to -1.</li> <li>Set

Create a new shortest empty Path List

Takes the old aggregated value and compares it to a new value wanting to be aggregated. @param value New Aggregated Value.

Coordinates the computation phases of SBVertex by monitoring for the completion of each state and moving to the next state. <ol> <li>selects pivots</l

Works in two major stages which are repeated and coordinated by the setting of a global state (set by the master compute class) <p/> <p/> <ul> <li>Sta

The create edge reader first determines if we should reverse each edge; some data sets are undirected graphs and need the input format to reverse thei

The create edge reader first determines if we should reverse each edge; some data sets are undirected graphs and need the input format to reverse thei