Class LocalT¶

Inheritance Relationships¶

Class Documentation¶

class LocalT : public NetworKit::SelectiveCommunityDetector¶

The local community expansion algorithm optimizing the T measure.

This implements the algorithm published in:

Fagnan, J., Zaiane, O., & Barbosa, D. (2014). Using triads to identify local community structure in social networks. In 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) (pp. 108–112). https://doi.org/10.1109/ASONAM.2014.6921568

Public Functions

LocalT(const Graph &g)¶

Constructs the Local T algorithm.

Parameters:

G – [in] The graph to detect communities on

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

Expands a set of seed nodes into a community.

Parameters:

s – [in] The seed nodes

Returns:

A community of the seed 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.