Now liveThe Skillselion MCP - thousands of ranked skills, loaded into your agent mid-task. No install.Get it →
eyadsibai avatar

Networkx

  • 61 installs
  • 7 repo stars
  • Updated January 15, 2026
  • eyadsibai/ltk

Helps with ai & agent building tasks.

About

networkx is a Claude Code skill for ai & agent building. It helps solo builders move faster with AI-assisted development.

  • networkx
  • AI & Agent Building
  • AI-coding skill

Networkx by the numbers

  • 61 all-time installs (skills.sh)
  • Ranked #6,381 of 16,546 AI & Agent Building skills by installs in the Skillselion catalog
  • Data as of Jul 30, 2026 (Skillselion catalog sync)
npx skills add https://github.com/eyadsibai/ltk --skill networkx

Add your badge

Show developers this skill is listed on Skillselion. Paste this into your README.

Listed on Skillselion
Installs61
repo stars7
Last updatedJanuary 15, 2026
Repositoryeyadsibai/ltk

What it does

Helps with ai & agent building tasks.

Files

SKILL.mdMarkdownGitHub ↗

NetworkX Graph Analysis

Python library for creating, analyzing, and visualizing networks and graphs.

When to Use

  • Social network analysis
  • Knowledge graphs and ontologies
  • Shortest path problems
  • Community detection
  • Citation/reference networks
  • Biological networks (protein interactions)

---

Graph Types

TypeEdgesMultiple Edges
GraphUndirectedNo
DiGraphDirectedNo
MultiGraphUndirectedYes
MultiDiGraphDirectedYes

---

Key Algorithms

Centrality Measures

MeasureWhat It FindsUse Case
DegreeMost connectionsPopular nodes
BetweennessBridge nodesInformation flow
ClosenessFastest reachEfficient spreaders
PageRankImportanceWeb pages, citations
EigenvectorInfluential connectionsWho knows important people

Path Algorithms

AlgorithmPurpose
Shortest pathMinimum hops
Weighted shortestMinimum cost
All pairs shortestFull distance matrix
DijkstraEfficient weighted paths

Community Detection

MethodApproach
LouvainModularity optimization
Greedy modularityHierarchical merging
Label propagationFast, scalable

---

Graph Generators

GeneratorModel
Erdős-RényiRandom edges
Barabási-AlbertPreferential attachment (scale-free)
Watts-StrogatzSmall-world
CompleteAll connected

---

Layout Algorithms

LayoutBest For
SpringGeneral purpose
CircularRegular structure
Kamada-KawaiAesthetics
SpectralClustered graphs

---

I/O Formats

FormatPreserves AttributesHuman Readable
GraphMLYesYes (XML)
Edge listNoYes
JSONYesYes
PandasYesVia DataFrame

---

Performance Considerations

ScaleApproach
< 10K nodesAny algorithm
10K - 100KUse approximate algorithms
> 100KConsider graph-tool or igraph

Key concept: NetworkX is pure Python - great for prototyping, may need alternatives for production scale.

---

Best Practices

  • Set random seeds for reproducibility
  • Choose correct graph type upfront
  • Use pandas integration for data exchange
  • Consider memory for large graphs

Resources

  • NetworkX docs: <https://networkx.org/documentation/latest/>
  • Tutorial: <https://networkx.org/documentation/latest/tutorial.html>

Related skills

This week in AI coding

Five minutes, every Monday - the tools, releases and tactics for developers.

unsubscribe anytime.