Print an adjacency matrix in nice format.
Print an adjacency matrix in nice format.
an adjacency matrix
Deal with multiple adjacency matrix filling strategy depending on graph orientation
Deal with multiple adjacency matrix filling strategy depending on graph orientation
original graph
chose a graph strategy completion depending on its nature. 3 choices: undirected, directed, birected.
an RDD of new edges weights and associated coordinates.
Get a suitable graph for MCL model algorithm.
Get a suitable graph for MCL model algorithm.
Each vertex id in the graph corresponds to a row id in the adjacency matrix.
original graph
a matching table with nodes ids and new ordered ids
prepared graph for MCL algorithm
Deal with self loop
Deal with self loop
Add one when weight is nil and remain as it is otherwise
original graph
a coefficient between 0 and 1 to influence clustering granularity and objective
an RDD of self loops weights and associated coordinates.
Transform an IndexedRowMatrix into a Graph
Transform an IndexedRowMatrix into a Graph
an adjacency matrix
vertices of original graph
associated graph
Transform a Graph into an IndexedRowMatrix
Transform a Graph into an IndexedRowMatrix
original graph
a coefficient between 0 and 1 to influence clustering granularity and objective
chose a graph strategy completion depending on its nature. 3 choices: undirected, directed, birected.
a ready adjacency matrix for MCL process.
Check graphOrientationStrategy choice for current graph
Utils functions for MCL algorithm implementation.