Class TCE¶

Inheritance Relationships¶

Class Documentation¶

class TCE : public NetworKit::SelectiveCommunityDetector¶

Triangle-based community expansion

The algorithm can handle weighted graphs.

Public Functions

TCE(const Graph &g, bool refine = false, bool useJaccard = false)¶

Construct a TCE object.

Parameters:

• G – [in] The graph to detect communities on

• refine – [in] If nodes shall be removed again if this makes the community better

• useJaccard – [in] use jaccard index for weight calculation.

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.