Home | Trees | Indices | Help |
|
---|
|
object --+ | Clustering --+ | VertexClustering
The clustering of the vertex set of a graph.
This class extends Clustering by linking it to a specific Graph object and by optionally storing the modularity score of the clustering.
Note:
since this class is linked to a Graph, destroying the graph by the
del
operator does not free the memory occupied by the
graph if there exists a VertexClustering that references the Graph.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from Inherited from |
|
|||
graph The graph belonging to this object |
|||
modularity The modularity score |
|||
q The modularity score |
|||
Inherited from Inherited from |
|
Creates a clustering object for a given graph.
|
Returns the giant community of the clustered graph. The giant component a community for which no larger community exists.
Note: there can be multiple giant communities, this method will return the copy of an arbitrary one if there are multiple giant communities. Precondition: the vertex set of the graph hasn't been modified since the moment the clustering was constructed. |
Recalculates the stored modularity value. This method must be called before querying the modularity score of the
clustering through the class member
|
Get the subgraph belonging to a given cluster.
Precondition: the vertex set of the graph hasn't been modified since the moment the clustering was constructed. |
|
graphThe graph belonging to this object
|
modularityThe modularity score
|
qThe modularity score
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Sat Aug 16 21:30:47 2008 | http://epydoc.sourceforge.net |