Skillget

genpark-louvain-modularity-community-detection-skill

mcp
Security Audit
Warn
Health Warn
  • No license — Repository has no license file
  • Description — Repository has a description
  • Active repo — Last push 0 days ago
  • Low visibility — Only 7 GitHub stars
Code Pass
  • Code scan — Scanned 6 files during light audit, no dangerous patterns found
Permissions Pass
  • Permissions — No dangerous permissions requested

No AI report is available for this listing yet.

SUMMARY

Louvain method for greedy modularity maximization community detection on weighted graphs

README.md

genpark-louvain-modularity-community-detection-skill

Agent Skill implementing the Louvain Method for Community Detection through local modularity optimization and partition extraction.

Architectural Overview

flowchart TD
    Adj["Graph Adjacency List"] --> Init["Assign Each Node to Singleton Community"]
    Init --> Eval["Evaluate Modularity Q = sum_c (in_c/(2m) - (tot_c/(2m))^2)"]
    Eval --> Test["Greedy Neighbor Swap: If Delta Q > 0, Move Node"]
    Test --> Converged{"No Further Gain ?"}
    Converged -- No --> Test
    Converged -- Yes --> Groups["Extract Community Membership Clusters"]

Reviews (0)

No results found