Class TwoPhaseL¶

Inheritance Relationships¶

Class Documentation¶

class TwoPhaseL : public NetworKit::SelectiveCommunityDetector¶

The two-phase local community detection algorithm optimizing the L-measure.

This is an implementation of the algorithm proposed in:

Chen, J., Zaïane, O., & Goebel, R. (2009). Local Community Identification in Social Networks. In 2009 International Conference on Advances in Social Network Analysis and Mining (pp. 237–242). https://doi.org/10.1109/ASONAM.2009.14

Public Functions

TwoPhaseL(const Graph &g)¶

Construct the algorithm class.

Parameters:

G – The graph on which communities shall be found.

virtual std::set<node> expandOneCommunity(const std::set<node> &s) override¶

Parameters:

• seeds – [in] seed nodes

• community – [out] as a set of nodes

std::set<node> expandOneCommunity(node seed)¶

Detect a community for the given seed node.

The default implementation calls expandOneCommunity(const std::set<node>&) with a set of one node.

Parameters:

seed – The seed to find the community for.

Returns:

The found community as set of node.

std::set<node> expandOneCommunity(const std::set<node> &seeds) = 0

Detect a single community for the given seed nodes.

This is useful if you know multiple nodes that should be part of the community. This method may throw an exception if the particular algorithm does not support multiple seeds.

Parameters:

seeds – The seeds for the community.

Returns:

The found community as set of nodes.