Description

Implementation of the density optimization algorithm as a post processing algorithm.

Performance

Initialization

Uses a matrix with three columns and a maximum of verticelAll()^2 rows with the edges between vertices and their weight (vertex<->vertex<->weight) of the original graph. Temporarily stores a copy of the graph to calculate a new community mapping.

Results

Uses a matrix with two columns and verticesAll() rows with the new community mapping (vertex<->community). Uses a matrix with three columns and a maximum of communityCount()^2+communityCount() rows with the edges between communities and their weight (community<->community<->weight).

#' @section PARAMETERS: This post processing algorithm does not require any parameters.

Author(s)

poltergeist0

See Also

DynComm