coverage: Coverage

In clustAnalytics: Cluster Evaluation on Graphs

Coverage

Description

Computes the coverage (fraction of internal edges with respect to the total number of edges) of a graph and its communities

Usage

coverage(g, com)

Arguments

g	Graph to be analyzed (as an igraph object).
com	Community membership integer vector. Each element corresponds to a vertex of the graph, and contains the index of the community it belongs to.

Value

Numeric value of the coverage of g and com.

See Also

Other cluster scoring functions: FOMD(), average_degree(), average_odf(), conductance(), cut_ratio(), density_ratio(), edges_inside(), expansion(), internal_density(), max_odf(), normalized_cut(), scoring_functions(), weighted_clustering_coefficient(), weighted_transitivity()

Examples

data(karate, package="igraphdata")
coverage(karate, membership(cluster_louvain(karate)))

clustAnalytics documentation built on May 29, 2024, 12:18 p.m.