Interface for algorithms that compute a clustering for a given graph. More...
#include <ogdf/module/ClustererModule.h>
Public Member Functions | |
| ClustererModule (const Graph &G) | |
| ClustererModule () | |
| Default constructor, initializes a clustering module. | |
| void | setGraph (const Graph &G) |
| Sets the graph to be clustered. | |
| const Graph & | getGraph () const |
| Returns the graph to be clustered. | |
| virtual void | computeClustering (SList< SimpleCluster * > &sl)=0 |
| compute some kind of clustering on the graph m_pGraph | |
| virtual void | createClusterGraph (ClusterGraph &C)=0 |
| translate computed clustering into cluster hierarchy in cluster graph C | |
| virtual double | computeCIndex (const Graph &G, node v)=0 |
| compute a clustering index for each vertex | |
| virtual double | computeCIndex (node v)=0 |
| compute a clustering index for each vertex | |
| virtual double | averageCIndex () |
| compute the average clustering index for the given graph | |
| virtual double | averageCIndex (const Graph &G) |
| void * | operator new (size_t nBytes) |
| void * | operator new (size_t, void *p) |
| void | operator delete (void *p, size_t nBytes) |
Protected Attributes | |
| const Graph * | m_pGraph |
Interface for algorithms that compute a clustering for a given graph.
The class ClustererModule is the base class for clustering classes that allow to compute some hierarchical clustering
Definition at line 113 of file ClustererModule.h.
| ogdf::ClustererModule::ClustererModule | ( | const Graph & | G | ) | [inline, explicit] |
Definition at line 118 of file ClustererModule.h.
| ogdf::ClustererModule::ClustererModule | ( | ) | [inline] |
Default constructor, initializes a clustering module.
Definition at line 122 of file ClustererModule.h.
| virtual double ogdf::ClustererModule::averageCIndex | ( | ) | [inline, virtual] |
compute the average clustering index for the given graph
Definition at line 151 of file ClustererModule.h.
| virtual double ogdf::ClustererModule::averageCIndex | ( | const Graph & | G | ) | [inline, virtual] |
Definition at line 155 of file ClustererModule.h.
compute a clustering index for each vertex
Implemented in ogdf::Clusterer.
| virtual double ogdf::ClustererModule::computeCIndex | ( | node | v | ) | [pure virtual] |
compute a clustering index for each vertex
Implemented in ogdf::Clusterer.
| virtual void ogdf::ClustererModule::computeClustering | ( | SList< SimpleCluster * > & | sl | ) | [pure virtual] |
compute some kind of clustering on the graph m_pGraph
This is the algorithm call that has to be implemented by derived classes
| sl | is the resulting list of clusters |
Implemented in ogdf::Clusterer.
| virtual void ogdf::ClustererModule::createClusterGraph | ( | ClusterGraph & | C | ) | [pure virtual] |
translate computed clustering into cluster hierarchy in cluster graph C
Implemented in ogdf::Clusterer.
| const Graph& ogdf::ClustererModule::getGraph | ( | ) | const [inline] |
Returns the graph to be clustered.
Definition at line 132 of file ClustererModule.h.
| void ogdf::ClustererModule::operator delete | ( | void * | p, | |
| size_t | nBytes | |||
| ) | [inline] |
Definition at line 170 of file ClustererModule.h.
| void* ogdf::ClustererModule::operator new | ( | size_t | , | |
| void * | p | |||
| ) | [inline] |
Definition at line 170 of file ClustererModule.h.
| void* ogdf::ClustererModule::operator new | ( | size_t | nBytes | ) | [inline] |
Definition at line 170 of file ClustererModule.h.
| void ogdf::ClustererModule::setGraph | ( | const Graph & | G | ) | [inline] |
Sets the graph to be clustered.
| G | is the input graph |
Definition at line 130 of file ClustererModule.h.
const Graph* ogdf::ClustererModule::m_pGraph [protected] |
Definition at line 168 of file ClustererModule.h.