All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Member Functions | List of all members
NetworKit::IsolatedInterpartitionExpansion Class Reference

Isolated inter-partition expansion is a measure for how well a partition (communtiy/cluster) is separated from the rest of the graph. More...

#include <IsolatedInterpartitionExpansion.h>

Public Member Functions

virtual void run () override
 Execute the algorithm. More...
virtual bool isSmallBetter () const override
virtual bool isParallel () const override
virtual std::string toString () const override
 Get the name of the algorithm. More...
- Public Member Functions inherited from NetworKit::LocalPartitionEvaluation
 LocalPartitionEvaluation (const Graph &G, const Partition &P)
 Initialize the partition evaluation method. More...
- Public Member Functions inherited from NetworKit::LocalCommunityEvaluation
virtual ~LocalCommunityEvaluation ()=default
 Default destructor for the virtual base class. More...
double getWeightedAverage () const
 Get the average value weighted by cluster size. More...
double getUnweightedAverage () const
 Get the (unweighted) average value of all clusters. More...
double getMaximumValue () const
 Get the maximum value of all clusters. More...
double getMinimumValue () const
 Get the minimum value of all clusters. More...
double getValue (index i) const
 Get the value of the specified cluster. More...
std::vector< double > getValues () const
 Get the values of all clusters. More...
- Public Member Functions inherited from NetworKit::Algorithm
 Algorithm ()
 Constructor to the algorithm base class. More...
virtual ~Algorithm ()=default
 Virtual default destructor. More...
bool hasFinished () const
 Indicates whether an algorithm has completed computation or not. More...
void assureFinished () const
 Assure that the algorithm has been run, throws a std::runtime_error otherwise. More...

Additional Inherited Members

- Protected Attributes inherited from NetworKit::LocalPartitionEvaluation
const GraphG
const PartitionP
- Protected Attributes inherited from NetworKit::LocalCommunityEvaluation
double weightedAverage
double unweightedAverage
double maximumValue
double minimumValue
std::vector< double > values
- Protected Attributes inherited from NetworKit::Algorithm
bool hasRun
 A boolean variable indicating whether an algorithm has finished its computation or not. More...

Detailed Description

Isolated inter-partition expansion is a measure for how well a partition (communtiy/cluster) is separated from the rest of the graph.

The expansion of a partition is defined as the weight of the cut divided by number of nodes in the partition or in the rest of the graph, whatever is smaller. Small values thus indicate that the cut is small compared to the size of the smaller of the separated parts. For the whole partitions usually the maximum or the unweighted average is used. Note that expansion values can be larger than 1.

See also Experiments on Density-Constrained Graph Clustering, Robert Görke, Andrea Kappes and Dorothea Wagner, JEA 2015:

Member Function Documentation

virtual bool NetworKit::IsolatedInterpartitionExpansion::isParallel ( ) const
false - this algorithm is not parallel.

Reimplemented from NetworKit::Algorithm.

virtual bool NetworKit::IsolatedInterpartitionExpansion::isSmallBetter ( ) const
true - smaller values are better than larger values.

Implements NetworKit::LocalCommunityEvaluation.

void NetworKit::IsolatedInterpartitionExpansion::run ( )

Execute the algorithm.

Implements NetworKit::Algorithm.

virtual std::string NetworKit::IsolatedInterpartitionExpansion::toString ( ) const

Get the name of the algorithm.

Reimplemented from NetworKit::Algorithm.

The documentation for this class was generated from the following files: