DynCommMain
Provides a single interface for all main algorithms in the different languages.
DynCommMain(Algorithm,Criterion,Parameters)
Includes methods to get results of processing and to interact with the vertices, edges and communities.
DynCommMain object
A two column matrix defining additional parameters to be passed to the selected ALGORITHM and CRITERION. The first column names the parameter and the second defines its value.
Owsinski-Zadrozny quality function parameter. Values [0.0:1.0]. Default: 0.5
Shi-Malik quality function kappa_min value. Value > 0 . Default 1
Treat graph as weighted. In other words, do not ignore weights for edges that define them when inserting edges in the graph. A weight of exactly zero removes the edge instead of inserting so its weight is never ignored. Without this parameter defined or for edges that do not have a weight defined, edges are assigned the default value of 1 (one). As an example, reading from a file may define weights (a third column) for some edges (defined in rows, one per row) and not for others. With this parameter defined, the edges that have weights that are not exactly zero, have their weight replaced by the default value.
Stops when, on a cycle of the algorithm, the quality is increased by less than the value given in this parameter.
Community-Vertex.
Boolean parameter that indicates if sending community mapping to a file
prints the community first, if true, or the vertex first, if false. See
communityMapping for details.
Default TRUE
Get additional results of the algorithm or the currently selected post processing steps. See results
Add and remove edges read from a file. See addRemoveEdges
Add and remove edges read from a matrix. See addRemoveEdges
Get the quality measurement of the graph after the last iteration. See quality
Get the number of communities after the last iteration. See communityCount
Get all communities after the last iteration. See communities
Get the number of community to community edges in the graph. See communitiesEdgeCount
Get the neighbours of the given community after the last iteration. See communityNeighbours
Get the sum of weights of the inner edges of the given community after the last iteration. See communityInnerEdgesWeight
Get the sum of weights of all edges of the given community after the last iteration. See communityTotalWeight
Get the weight of the edge that goes from source to destination after the last iteration. See communityEdgeWeight
Get the amount of vertices in the given community after the last iteration. See communityVertexCount
Get the community of the given vertex after the last iteration. See community
Get the total number of vertices after the last iteration. See vertexCount
Get all vertices in the graph after the last iteration. See verticesAll
Get the neighbours of the given vertex after the last iteration. See neighbours
Get the weight of the edge that goes from source vertex to destination vertex after the last iteration. See edgeWeight
Get all vertices belonging to the given community after the last iteration. See vertices
Get the number of vertex to vertex edges in the graph. See edgeCount
Get the community mapping for all communities after the last iteration.See communityMapping
Get the community mapping for all communities after the last iteration.See communityMapping
Get the cumulative time spent on processing after the last iteration. See time
poltergeist0
## Not run:
Parameters<-matrix(c("-e","0.1"),1,2,TRUE)
dc<-DynCommMain(ALGORITHM$LOUVAIN,CRITERION$MODULARITY,Parameters)
dc$addRemoveEdgesFile("initial_graph.txt")
dc$communityCount()
dc$communities()
dc$communityNodeCount(1)
dc$vertices(1)
dc$communityMapping(TRUE)
dc$time()
dc$addRemoveEdgesFile("s0000000000.txt")
## End(Not run)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.