ig-degree-betweenness 0.1.3

Smith-Pittman Community Detection Algorithm for 'igraph' Objects (2024)

ig_degree_betweenness_py

Python implementation of the Smith-Pittman Algorithm available in the ig.degree.betweenness R package.

This code can be used both as a standard Python library for scripting and as a command-line tool.

Installation

To install from PyPI, run:

pip install ig-degree-betweenness

To install from GitHub, run.

pip install git+https://github.com/benyamindsmith/ig_degree_betweenness_py.git

Usage

Scripting Usage

To use this in a typical scripting setting compute the clustering with the following code.

import igraph as ig
from ig_degree_betweenness import community_degree_betweenness
import matplotlib.pyplot as plt


# Read edges
with open("edgelist.txt", "r") as f:
    edges = [tuple(line.strip().split("\t")) for line in f]

# Build graph with directed flag
g = ig.Graph.TupleList(edges, directed=True)

# Compute clustering
sp_clustering = community_degree_betweenness(g)

This can be further visualized:

# Visualize Communities
fig1, ax1 = plt.subplots()
ig.plot(
    sp_clustering,
    target=ax1,
    mark_groups=True,
    vertex_size=15,
    edge_width=0.5,
)
fig1.set_size_inches(20, 20)

To run this code in the terminal, run:

Terminal Usage

# for an undirected graph (default)
$ python ig_degree_betweenness my_edges.txt

# for a directed graph
$ python ig_degree_betweenness -d my_edges.txt