alterlab-networkx
Creates, analyzes, and visualizes complex networks and graphs in Python with NetworkX. Use when working with network/graph data structures, analyzing relationships between entities, computing graph algorithms (shortest paths, centrality, clustering), detecting communities, genera
Install
npx skills add https://github.com/AlterLab-IEU/AlterLab-Academic-Skills/tree/main/skills/data-science/alterlab-networkx
claude plugin marketplace add https://llmmart.ai/marketplace.json && claude plugin install alterlab-ieu-alterlab-academic-skills@llmmart
git clone https://github.com/AlterLab-IEU/AlterLab-Academic-Skills.git
The skills CLI installs just this skill, for any of its supported agents. Claude Code installs the whole alterlab-ieu/alterlab-academic-skills collection as a plugin from our marketplace. Git is the plain clone.
Skill manifest
NetworkX
Overview
NetworkX is a Python package for creating, manipulating, and analyzing complex networks and graphs. Use this skill when working with network or graph data structures, including social networks, biological networks, transportation systems, citation networks, knowledge graphs, or any system involving relationships between entities.
When to Use This Skill
Invoke this skill when tasks involve:
- Creating graphs: Building network structures from data, adding nodes and edges with attributes
- Graph analysis: Computing centrality measures, finding shortest paths, detecting communities, measuring clustering
- Graph algorithms: Running standard algorithms like Dijkstra's, PageRank, minimum spanning trees, maximum flow
- Network generation: Creating synthetic networks (random, scale-free, small-world models) for testing or simulation
- Graph I/O: Reading from or writing to various formats (edge lists, GraphML, JSON, CSV, adjacency matrices)
- Visualization: Drawing and customizing network visualizations with matplotlib or interactive libraries
- Network comparison: Checking isomorphism, computing graph metrics, analyzing structural properties
Does NOT Trigger
| Scenario | Use Instead |
|---|---|
| Training graph neural networks (GCN/GAT, message passing, node classification on Cora-style data) | alterlab-torch-geometric |
| Choosing and defending social-network measures or fitting ERGMs for a social-science study | alterlab-sna |
| Building a citation / co-citation network around seed papers from open citation data (OpenCitations, Crossref) | alterlab-citation-graph |
Hand-off rule. When the request matches a row above, open your answer by naming that skill by its exact id (for example alterlab-torch-geometric) and saying in one line why it fits better, then stop applying this skill's procedure. Name it even when you also need to ask for missing input. If only part of the request is out of scope, name the skill for that part and do only the in-scope part. A brief general pointer is fine; the named skill does the work.
Core Capabilities
1. Graph Creation and Manipulation
NetworkX supports four main graph types:
- Graph: Undirected graphs with single edges
- DiGraph: Directed graphs with one-way connections
- MultiGraph: Undirected graphs allowing multiple edges between nodes
- MultiDiGraph: Directed graphs with multiple edges
Create graphs by:
import networkx as nx
# Create empty graph
G = nx.Graph()
# Add nodes (can be any hashable type)
G.add_node(1)
G.add_nodes_from([2, 3, 4])
G.add_node("protein_A", type='enzyme', weight=1.5)
# Add edges
G.add_edge(1, 2)
G.add_edges_from([(1, 3), (2, 4)])
G.add_edge(1, 4, weight=0.8, relation='interacts')
Reference: See references/graph-basics.md for comprehensive guidance on creating, modifying, examining, and managing graph structures, including working with attributes and subgraphs.
2. Graph Algorithms
NetworkX provides extensive algorithms for network analysis:
Shortest Paths:
# Find shortest path
path = nx.shortest_path(G, source=1, target=5)
length = nx.shortest_path_length(G, source=1, target=5, weight='weight')
Centrality Measures:
# Degree centrality
degree_cent = nx.degree_centrality(G)
# Betweenness centrality
betweenness = nx.betweenness_centrality(G)
# PageRank
pagerank = nx.pagerank(G)
Community Detection:
from networkx.algorithms import community
# Detect communities
communities = community.greedy_modularity_communities(G)
communities = community.louvain_communities(G, seed=42)
communities = community.leiden_communities(G, metric='modularity', seed=42) # NetworkX >= 3.7
Connectivity:
# Check connectivity
is_connected = nx.is_connected(G)
# Find connected components
components = list(nx.connected_components(G))
Reference: See references/algorithms.md for detailed documentation on all available algorithms including shortest paths, centrality measures, clustering, community detection, flows, matching, tree algorithms, and graph traversal.
3. Graph Generators
Create synthetic networks for testing, simulation, or modeling:
Classic Graphs:
# Complete graph
G = nx.complete_graph(n=10)
# Cycle graph
G = nx.cycle_graph(n=20)
# Known graphs
G = nx.karate_club_graph()
G = nx.petersen_graph()
Random Networks:
# Erdős-Rényi random graph
G = nx.erdos_renyi_graph(n=100, p=0.1, seed=42)
# Barabási-Albert scale-free network
G = nx.barabasi_albert_graph(n=100, m=3, seed=42)
# Watts-Strogatz small-world network
G = nx.watts_strogatz_graph(n=100, k=6, p=0.1, seed=42)
Structured Networks:
# Grid graph
G = nx.grid_2d_graph(m=5, n=7)
# Random tree
G = nx.random_labeled_tree(n=100, seed=42)
Reference: See references/generators.md for comprehensive coverage of all graph generators including classic, random, lattice, bipartite, and specialized network models with detailed parameters and use cases.
4. Reading and Writing Graphs
NetworkX supports numerous file formats and data sources:
File Formats:
# Edge list
G = nx.read_edgelist('graph.edgelist')
nx.write_edgelist(G, 'graph.edgelist')
# GraphML (preserves attributes)
G = nx.read_graphml('graph.graphml')
nx.write_graphml(G, 'graph.graphml')
# GML
G = nx.read_gml('graph.gml')
nx.write_gml(G, 'graph.gml')
# JSON
data = nx.node_link_data(G)
G = nx.node_link_graph(data)
Pandas Integration:
import pandas as pd
# From DataFrame
df = pd.DataFrame({'source': [1, 2, 3], 'target': [2, 3, 4], 'weight': [0.5, 1.0, 0.75]})
G = nx.from_pandas_edgelist(df, 'source', 'target', edge_attr='weight')
# To DataFrame
df = nx.to_pandas_edgelist(G)
Matrix Formats:
import numpy as np
# Adjacency matrix
A = nx.to_numpy_array(G)
G = nx.from_numpy_array(A)
# Sparse matrix
A = nx.to_scipy_sparse_array(G)
G = nx.from_scipy_sparse_array(A)
Reference: See references/io.md for complete documentation on all I/O formats including CSV, SQL databases, Cytoscape, DOT, and guidance on format selection for different use cases.
5. Visualization
Create clear and informative network visualizations:
Basic Visualization:
import matplotlib.pyplot as plt
# Simple draw
nx.draw(G, with_labels=True)
plt.show()
# With layout
pos = nx.spring_layout(G, seed=42)
nx.draw(G, pos=pos, with_labels=True, node_color='lightblue', node_size=500)
plt.show()
Customization:
# Color by degree
node_colors = [G.degree(n) for n in G.nodes()]
nx.draw(G, node_color=node_colors, cmap=plt.cm.viridis)
# Size by centrality
centrality = nx.betweenness_centrality(G)
node_sizes = [3000 * centrality[n] for n in G.nodes()]
nx.draw(G, node_size=node_sizes)
# Edge weights
edge_widths = [3 * G[u][v].get('weight', 1) for u, v in G.edges()]
nx.draw(G, width=edge_widths)
Layout Algorithms:
# Spring layout (force-directed)
pos = nx.spring_layout(G, seed=42)
# Circular layout
pos = nx.circular_layout(G)
# Kamada-Kawai layout
pos = nx.kamada_kawai_layout(G)
# Spectral layout
pos = nx.spectral_layout(G)
Publication Quality:
plt.figure(figsize=(12, 8))
pos = nx.spring_layout(G, seed=42)
nx.draw(G, pos=pos, node_color='lightblue', node_size=500,
edge_color='gray', with_labels=True, font_size=10)
plt.title('Network Visualization', fontsize=16)
plt.axis('off')
plt.tight_layout()
plt.savefig('network.png', dpi=300, bbox_inches='tight')
plt.savefig('network.pdf', bbox_inches='tight') # Vector format
Reference: See references/visualization.md for extensive documentation on visualization techniques including layout algorithms, customization options, interactive visualizations with Plotly and PyVis, 3D networks, and publication-quality figure creation.
Working with NetworkX
Installation
Examples here target NetworkX 3.x (current 3.7 as of 2026-09). Several APIs were removed in 3.0 —
nx.info, nx.write_gpickle/nx.read_gpickle, nx.read_shp/nx.write_shp,
nx.graph_clique_number — and nx.random_tree was replaced by
nx.random_labeled_tree; the references note the replacements. NetworkX 3.7 adds native
Leiden (nx.community.leiden_communities), makes maximal_independent_set return a set,
and deprecates bfs_predecessors (removed in 3.9). Since 3.6, node_link_data writes
edges under the key "edges" (the old link= keyword is gone; pass edges="links" to
produce d3-style JSON).
# Check installed version
import networkx as nx
print(nx.__version__)
# No install step: uv resolves NetworkX per call (3.7 needs Python >= 3.12;
# [default] adds numpy/scipy/pandas/matplotlib)
uv run --python ">=3.12" --with 'networkx[default]>=3.4' python analysis.py
Common Workflow Pattern
Most NetworkX tasks follow this pattern:
Create or Load Graph:
# From scratch G = nx.Graph() G.add_edges_from([(1, 2), (2, 3), (3, 4)]) # Or load from file/data G = nx.read_edgelist('data.txt')Examine Structure:
print(f"Nodes: {G.number_of_nodes()}") print(f"Edges: {G.number_of_edges()}") print(f"Density: {nx.density(G)}") print(f"Connected: {nx.is_connected(G)}")Analyze:
# Compute metrics degree_cent = nx.degree_centrality(G) avg_clustering = nx.average_clustering(G) # Find paths path = nx.shortest_path(G, source=1, target=4) # Detect communities communities = community.greedy_modularity_communities(G)Visualize:
pos = nx.spring_layout(G, seed=42) nx.draw(G, pos=pos, with_labels=True) plt.show()Export Results:
# Save graph nx.write_graphml(G, 'analyzed_network.graphml') # Save metrics df = pd.DataFrame({ 'node': list(degree_cent.keys()), 'centrality': list(degree_cent.values()) }) df.to_csv('centrality_results.csv', index=False)
Important Considerations
Floating Point Precision: When graphs contain floating-point numbers, all results are inherently approximate due to precision limitations. This can affect algorithm outcomes, particularly in minimum/maximum computations.
Memory and Performance: Each time a script runs, graph data must be loaded into memory. For large networks:
- Use appropriate data structures (sparse matrices for large sparse graphs)
- Consider loading only necessary subgraphs
- Use efficient file formats (pickle for Python objects, compressed formats)
- Leverage approximate algorithms for very large networks (e.g.,
kparameter in centrality calculations)
Node and Edge Types:
- Nodes can be any hashable Python object (numbers, strings, tuples, custom objects)
- Use meaningful identifiers for clarity
- When removing nodes, all incident edges are automatically removed
Random Seeds: Always set random seeds for reproducibility in random graph generation and force-directed layouts:
G = nx.erdos_renyi_graph(n=100, p=0.1, seed=42)
pos = nx.spring_layout(G, seed=42)
Quick Reference
Basic Operations
# Create
G = nx.Graph()
G.add_edge(1, 2)
# Query
G.number_of_nodes()
G.number_of_edges()
G.degree(1)
list(G.neighbors(1))
# Check
G.has_node(1)
G.has_edge(1, 2)
nx.is_connected(G)
# Modify
G.remove_node(1)
G.remove_edge(1, 2)
G.clear()
Essential Algorithms
# Paths
nx.shortest_path(G, source, target)
nx.all_pairs_shortest_path(G)
# Centrality
nx.degree_centrality(G)
nx.betweenness_centrality(G)
nx.closeness_centrality(G)
nx.pagerank(G)
# Clustering
nx.clustering(G)
nx.average_clustering(G)
# Components
nx.connected_components(G)
nx.strongly_connected_components(G) # Directed
# Community
community.greedy_modularity_communities(G)
File I/O Quick Reference
# Read
nx.read_edgelist('file.txt')
nx.read_graphml('file.graphml')
nx.read_gml('file.gml')
# Write
nx.write_edgelist(G, 'file.txt')
nx.write_graphml(G, 'file.graphml')
nx.write_gml(G, 'file.gml')
# Pandas
nx.from_pandas_edgelist(df, 'source', 'target')
nx.to_pandas_edgelist(G)
Resources
This skill includes comprehensive reference documentation:
references/graph-basics.md
Detailed guide on graph types, creating and modifying graphs, adding nodes and edges, managing attributes, examining structure, and working with subgraphs.
references/algorithms.md
Complete coverage of NetworkX algorithms including shortest paths, centrality measures, connectivity, clustering, community detection, flow algorithms, tree algorithms, matching, coloring, isomorphism, and graph traversal.
references/generators.md
Comprehensive documentation on graph generators including classic graphs, random models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz), lattices, trees, social network models, and specialized generators.
references/io.md
Complete guide to reading and writing graphs in various formats: edge lists, adjacency lists, GraphML, GML, JSON, CSV, Pandas DataFrames, NumPy arrays, SciPy sparse matrices, database integration, and format selection guidelines.
references/visualization.md
Extensive documentation on visualization techniques including layout algorithms, customizing node and edge appearance, labels, interactive visualizations with Plotly and PyVis, 3D networks, bipartite layouts, and creating publication-quality figures.
Additional Resources
- Official Documentation: https://networkx.org/documentation/latest/
- Tutorial: https://networkx.org/documentation/latest/tutorial.html
- Gallery: https://networkx.org/documentation/latest/auto_examples/index.html
- GitHub: https://github.com/networkx/networkx
Files (alterlab-academic-skills)
-
evals
-
evals.json 5.4 KB
Loading…
-
-
references
-
algorithms.md 9.7 KB
Loading… -
generators.md 8.1 KB
Loading… -
graph-basics.md 6.2 KB
Loading… -
io.md 9.6 KB
Loading… -
visualization.md 12.1 KB
Loading…
-
-
SKILL.md 14.7 KB
--- name: alterlab-networkx description: Creates, analyzes, and visualizes complex networks and graphs in Python with NetworkX. Use when working with network/graph data structures, analyzing relationships between entities, computing graph algorithms (shortest paths, centrality, clustering), detecting communities, generating synthetic networks, or visualizing topologies — applicable to social, biological, transportation, citation, and any pairwise-relationship networks. This is classical graph analytics, not deep learning — for training graph neural networks (GCN/message passing, node/edge/graph classification on Cora-style data) use alterlab-torch-geometric instead. Part of the AlterLab Academic Skills suite. license: MIT allowed-tools: Read Write Edit Bash(python:*) Bash(uv:*) compatibility: No API key required. Runs locally via `uv run --python ">=3.12" --with "networkx[default]>=3.4" python script.py` (no install step; the interpreter pin matters because an older default Python resolves older releases); requires networkx >= 3.4 (current 3.7 as of 2026-09; native Leiden needs 3.7). metadata: skill-author: AlterLab version: "1.0.2" last_updated: "2026-11-02" --- # NetworkX ## Overview NetworkX is a Python package for creating, manipulating, and analyzing complex networks and graphs. Use this skill when working with network or graph data structures, including social networks, biological networks, transportation systems, citation networks, knowledge graphs, or any system involving relationships between entities. ## When to Use This Skill Invoke this skill when tasks involve: - **Creating graphs**: Building network structures from data, adding nodes and edges with attributes - **Graph analysis**: Computing centrality measures, finding shortest paths, detecting communities, measuring clustering - **Graph algorithms**: Running standard algorithms like Dijkstra's, PageRank, minimum spanning trees, maximum flow - **Network generation**: Creating synthetic networks (random, scale-free, small-world models) for testing or simulation - **Graph I/O**: Reading from or writing to various formats (edge lists, GraphML, JSON, CSV, adjacency matrices) - **Visualization**: Drawing and customizing network visualizations with matplotlib or interactive libraries - **Network comparison**: Checking isomorphism, computing graph metrics, analyzing structural properties ### Does NOT Trigger | Scenario | Use Instead | |----------|-------------| | Training graph neural networks (GCN/GAT, message passing, node classification on Cora-style data) | `alterlab-torch-geometric` | | Choosing and defending social-network measures or fitting ERGMs for a social-science study | `alterlab-sna` | | Building a citation / co-citation network around seed papers from open citation data (OpenCitations, Crossref) | `alterlab-citation-graph` | **Hand-off rule.** When the request matches a row above, open your answer by naming that skill by its exact id (for example `alterlab-torch-geometric`) and saying in one line why it fits better, then stop applying this skill's procedure. Name it even when you also need to ask for missing input. If only part of the request is out of scope, name the skill for that part and do only the in-scope part. A brief general pointer is fine; the named skill does the work. ## Core Capabilities ### 1. Graph Creation and Manipulation NetworkX supports four main graph types: - **Graph**: Undirected graphs with single edges - **DiGraph**: Directed graphs with one-way connections - **MultiGraph**: Undirected graphs allowing multiple edges between nodes - **MultiDiGraph**: Directed graphs with multiple edges Create graphs by: ```python import networkx as nx # Create empty graph G = nx.Graph() # Add nodes (can be any hashable type) G.add_node(1) G.add_nodes_from([2, 3, 4]) G.add_node("protein_A", type='enzyme', weight=1.5) # Add edges G.add_edge(1, 2) G.add_edges_from([(1, 3), (2, 4)]) G.add_edge(1, 4, weight=0.8, relation='interacts') ``` **Reference**: See `references/graph-basics.md` for comprehensive guidance on creating, modifying, examining, and managing graph structures, including working with attributes and subgraphs. ### 2. Graph Algorithms NetworkX provides extensive algorithms for network analysis: **Shortest Paths**: ```python # Find shortest path path = nx.shortest_path(G, source=1, target=5) length = nx.shortest_path_length(G, source=1, target=5, weight='weight') ``` **Centrality Measures**: ```python # Degree centrality degree_cent = nx.degree_centrality(G) # Betweenness centrality betweenness = nx.betweenness_centrality(G) # PageRank pagerank = nx.pagerank(G) ``` **Community Detection**: ```python from networkx.algorithms import community # Detect communities communities = community.greedy_modularity_communities(G) communities = community.louvain_communities(G, seed=42) communities = community.leiden_communities(G, metric='modularity', seed=42) # NetworkX >= 3.7 ``` **Connectivity**: ```python # Check connectivity is_connected = nx.is_connected(G) # Find connected components components = list(nx.connected_components(G)) ``` **Reference**: See `references/algorithms.md` for detailed documentation on all available algorithms including shortest paths, centrality measures, clustering, community detection, flows, matching, tree algorithms, and graph traversal. ### 3. Graph Generators Create synthetic networks for testing, simulation, or modeling: **Classic Graphs**: ```python # Complete graph G = nx.complete_graph(n=10) # Cycle graph G = nx.cycle_graph(n=20) # Known graphs G = nx.karate_club_graph() G = nx.petersen_graph() ``` **Random Networks**: ```python # Erdős-Rényi random graph G = nx.erdos_renyi_graph(n=100, p=0.1, seed=42) # Barabási-Albert scale-free network G = nx.barabasi_albert_graph(n=100, m=3, seed=42) # Watts-Strogatz small-world network G = nx.watts_strogatz_graph(n=100, k=6, p=0.1, seed=42) ``` **Structured Networks**: ```python # Grid graph G = nx.grid_2d_graph(m=5, n=7) # Random tree G = nx.random_labeled_tree(n=100, seed=42) ``` **Reference**: See `references/generators.md` for comprehensive coverage of all graph generators including classic, random, lattice, bipartite, and specialized network models with detailed parameters and use cases. ### 4. Reading and Writing Graphs NetworkX supports numerous file formats and data sources: **File Formats**: ```python # Edge list G = nx.read_edgelist('graph.edgelist') nx.write_edgelist(G, 'graph.edgelist') # GraphML (preserves attributes) G = nx.read_graphml('graph.graphml') nx.write_graphml(G, 'graph.graphml') # GML G = nx.read_gml('graph.gml') nx.write_gml(G, 'graph.gml') # JSON data = nx.node_link_data(G) G = nx.node_link_graph(data) ``` **Pandas Integration**: ```python import pandas as pd # From DataFrame df = pd.DataFrame({'source': [1, 2, 3], 'target': [2, 3, 4], 'weight': [0.5, 1.0, 0.75]}) G = nx.from_pandas_edgelist(df, 'source', 'target', edge_attr='weight') # To DataFrame df = nx.to_pandas_edgelist(G) ``` **Matrix Formats**: ```python import numpy as np # Adjacency matrix A = nx.to_numpy_array(G) G = nx.from_numpy_array(A) # Sparse matrix A = nx.to_scipy_sparse_array(G) G = nx.from_scipy_sparse_array(A) ``` **Reference**: See `references/io.md` for complete documentation on all I/O formats including CSV, SQL databases, Cytoscape, DOT, and guidance on format selection for different use cases. ### 5. Visualization Create clear and informative network visualizations: **Basic Visualization**: ```python import matplotlib.pyplot as plt # Simple draw nx.draw(G, with_labels=True) plt.show() # With layout pos = nx.spring_layout(G, seed=42) nx.draw(G, pos=pos, with_labels=True, node_color='lightblue', node_size=500) plt.show() ``` **Customization**: ```python # Color by degree node_colors = [G.degree(n) for n in G.nodes()] nx.draw(G, node_color=node_colors, cmap=plt.cm.viridis) # Size by centrality centrality = nx.betweenness_centrality(G) node_sizes = [3000 * centrality[n] for n in G.nodes()] nx.draw(G, node_size=node_sizes) # Edge weights edge_widths = [3 * G[u][v].get('weight', 1) for u, v in G.edges()] nx.draw(G, width=edge_widths) ``` **Layout Algorithms**: ```python # Spring layout (force-directed) pos = nx.spring_layout(G, seed=42) # Circular layout pos = nx.circular_layout(G) # Kamada-Kawai layout pos = nx.kamada_kawai_layout(G) # Spectral layout pos = nx.spectral_layout(G) ``` **Publication Quality**: ```python plt.figure(figsize=(12, 8)) pos = nx.spring_layout(G, seed=42) nx.draw(G, pos=pos, node_color='lightblue', node_size=500, edge_color='gray', with_labels=True, font_size=10) plt.title('Network Visualization', fontsize=16) plt.axis('off') plt.tight_layout() plt.savefig('network.png', dpi=300, bbox_inches='tight') plt.savefig('network.pdf', bbox_inches='tight') # Vector format ``` **Reference**: See `references/visualization.md` for extensive documentation on visualization techniques including layout algorithms, customization options, interactive visualizations with Plotly and PyVis, 3D networks, and publication-quality figure creation. ## Working with NetworkX ### Installation Examples here target **NetworkX 3.x** (current 3.7 as of 2026-09). Several APIs were removed in 3.0 — `nx.info`, `nx.write_gpickle`/`nx.read_gpickle`, `nx.read_shp`/`nx.write_shp`, `nx.graph_clique_number` — and `nx.random_tree` was replaced by `nx.random_labeled_tree`; the references note the replacements. NetworkX 3.7 adds native Leiden (`nx.community.leiden_communities`), makes `maximal_independent_set` return a set, and deprecates `bfs_predecessors` (removed in 3.9). Since 3.6, `node_link_data` writes edges under the key `"edges"` (the old `link=` keyword is gone; pass `edges="links"` to produce d3-style JSON). ```python # Check installed version import networkx as nx print(nx.__version__) ``` ```bash # No install step: uv resolves NetworkX per call (3.7 needs Python >= 3.12; # [default] adds numpy/scipy/pandas/matplotlib) uv run --python ">=3.12" --with 'networkx[default]>=3.4' python analysis.py ``` ### Common Workflow Pattern Most NetworkX tasks follow this pattern: 1. **Create or Load Graph**: ```python # From scratch G = nx.Graph() G.add_edges_from([(1, 2), (2, 3), (3, 4)]) # Or load from file/data G = nx.read_edgelist('data.txt') ``` 2. **Examine Structure**: ```python print(f"Nodes: {G.number_of_nodes()}") print(f"Edges: {G.number_of_edges()}") print(f"Density: {nx.density(G)}") print(f"Connected: {nx.is_connected(G)}") ``` 3. **Analyze**: ```python # Compute metrics degree_cent = nx.degree_centrality(G) avg_clustering = nx.average_clustering(G) # Find paths path = nx.shortest_path(G, source=1, target=4) # Detect communities communities = community.greedy_modularity_communities(G) ``` 4. **Visualize**: ```python pos = nx.spring_layout(G, seed=42) nx.draw(G, pos=pos, with_labels=True) plt.show() ``` 5. **Export Results**: ```python # Save graph nx.write_graphml(G, 'analyzed_network.graphml') # Save metrics df = pd.DataFrame({ 'node': list(degree_cent.keys()), 'centrality': list(degree_cent.values()) }) df.to_csv('centrality_results.csv', index=False) ``` ### Important Considerations **Floating Point Precision**: When graphs contain floating-point numbers, all results are inherently approximate due to precision limitations. This can affect algorithm outcomes, particularly in minimum/maximum computations. **Memory and Performance**: Each time a script runs, graph data must be loaded into memory. For large networks: - Use appropriate data structures (sparse matrices for large sparse graphs) - Consider loading only necessary subgraphs - Use efficient file formats (pickle for Python objects, compressed formats) - Leverage approximate algorithms for very large networks (e.g., `k` parameter in centrality calculations) **Node and Edge Types**: - Nodes can be any hashable Python object (numbers, strings, tuples, custom objects) - Use meaningful identifiers for clarity - When removing nodes, all incident edges are automatically removed **Random Seeds**: Always set random seeds for reproducibility in random graph generation and force-directed layouts: ```python G = nx.erdos_renyi_graph(n=100, p=0.1, seed=42) pos = nx.spring_layout(G, seed=42) ``` ## Quick Reference ### Basic Operations ```python # Create G = nx.Graph() G.add_edge(1, 2) # Query G.number_of_nodes() G.number_of_edges() G.degree(1) list(G.neighbors(1)) # Check G.has_node(1) G.has_edge(1, 2) nx.is_connected(G) # Modify G.remove_node(1) G.remove_edge(1, 2) G.clear() ``` ### Essential Algorithms ```python # Paths nx.shortest_path(G, source, target) nx.all_pairs_shortest_path(G) # Centrality nx.degree_centrality(G) nx.betweenness_centrality(G) nx.closeness_centrality(G) nx.pagerank(G) # Clustering nx.clustering(G) nx.average_clustering(G) # Components nx.connected_components(G) nx.strongly_connected_components(G) # Directed # Community community.greedy_modularity_communities(G) ``` ### File I/O Quick Reference ```python # Read nx.read_edgelist('file.txt') nx.read_graphml('file.graphml') nx.read_gml('file.gml') # Write nx.write_edgelist(G, 'file.txt') nx.write_graphml(G, 'file.graphml') nx.write_gml(G, 'file.gml') # Pandas nx.from_pandas_edgelist(df, 'source', 'target') nx.to_pandas_edgelist(G) ``` ## Resources This skill includes comprehensive reference documentation: ### references/graph-basics.md Detailed guide on graph types, creating and modifying graphs, adding nodes and edges, managing attributes, examining structure, and working with subgraphs. ### references/algorithms.md Complete coverage of NetworkX algorithms including shortest paths, centrality measures, connectivity, clustering, community detection, flow algorithms, tree algorithms, matching, coloring, isomorphism, and graph traversal. ### references/generators.md Comprehensive documentation on graph generators including classic graphs, random models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz), lattices, trees, social network models, and specialized generators. ### references/io.md Complete guide to reading and writing graphs in various formats: edge lists, adjacency lists, GraphML, GML, JSON, CSV, Pandas DataFrames, NumPy arrays, SciPy sparse matrices, database integration, and format selection guidelines. ### references/visualization.md Extensive documentation on visualization techniques including layout algorithms, customizing node and edge appearance, labels, interactive visualizations with Plotly and PyVis, 3D networks, bipartite layouts, and creating publication-quality figures. ## Additional Resources - **Official Documentation**: https://networkx.org/documentation/latest/ - **Tutorial**: https://networkx.org/documentation/latest/tutorial.html - **Gallery**: https://networkx.org/documentation/latest/auto_examples/index.html - **GitHub**: https://github.com/networkx/networkx
Comments (0)
Sign in to join the conversation.
Reviews (0)
No reviews yet.
No comments yet.