cluster.graph: Cluster a Graph and Extract Largest Component

In MadanTextNetwork: Persian Text Mining Tool for Co-Occurrence Network

Cluster a Graph and Extract Largest Component

Description

This function applies clustering to a graph and extracts the largest connected component.

Usage

cluster.graph(network)

Arguments

network

A graph object.

Value

A list containing three elements: 'gr' with the largest connected component of the graph, 'cl' with a data frame of nodes and their cluster membership, and 'node.impo' with a data frame of node importance measures like degree, closeness, and betweenness.

Examples

## Not run: 
  # Assuming 'network' is a predefined graph object
  cluster.graph(network)

## End(Not run)

MadanTextNetwork documentation built on May 29, 2024, 9:38 a.m.