NetworkX MCP Server
Resolves DOIs to publication metadata using the CrossRef API, enabling citation network building, author impact analysis, and literature discovery.
Click on "Deploy Server".
Wait a few minutes for the server to deploy. Once ready, it will show a "Started" state.
In the chat, type
@followed by the MCP server name and your instructions, e.g., "@NetworkX MCP Server Find the shortest path between nodes A and B in my graph."
That's it! The server will respond to your query, and you can continue using it as needed.
Here is a step-by-step guide with screenshots.
NetworkX MCP Server
Academic-focused graph analysis in your AI conversations - The first and only NetworkX MCP server specialized for academic research and citation analysis.
๐ What is this?
NetworkX MCP Server enables Large Language Models (like Claude) to perform sophisticated academic research and citation analysis directly within conversations. Built specifically for researchers, academics, and students who need to analyze citation networks, calculate author impact metrics, and discover literature patterns.
Stop switching between VOSviewer, CitNetExplorer, and manual analysis. Start doing academic research in your AI conversations.
๐ฏ Key Features
๐ฌ Academic Research Tools
Citation Network Analysis: Build citation networks from DOIs using CrossRef API
Author Impact Metrics: Calculate h-index, total citations, and academic influence
Literature Discovery: Automated paper recommendations based on citation patterns
Collaboration Analysis: Map co-authorship networks and identify key researchers
Research Trend Detection: Analyze publication and citation trends over time
๐ Core Graph Operations
43 Graph Tools: From basic operations to advanced algorithms like PageRank
BibTeX Export: Export citation networks in academic-standard BibTeX format
CrossRef Integration: Access 156+ million academic papers via DOI resolution
Visualization: Generate publication-ready network visualizations
First of Its Kind: The only academic-focused NetworkX MCP server
Related MCP server: Graphistry MCP
๐ Why NetworkX MCP Server for Academic Research?
Built for Researchers: Designed specifically for academic workflows and citation analysis
Real-time Literature Discovery: Find related papers and collaboration opportunities instantly
Reproducible Research: Python-based, version-controlled, and shareable analysis workflows
Academic Data Integration: Direct access to CrossRef's 156+ million paper database
No Enterprise Complexity: Focus on research, not IT infrastructure
Cost-Effective: Free alternative to expensive commercial citation analysis tools
๐ฆ Installation
pip install networkx-mcp-server๐ Quick Start
1. Install the server
pip install networkx-mcp-server2. Configure Claude Desktop
Add to your claude_desktop_config.json:
MacOS: ~/Library/Application Support/Claude/claude_desktop_config.json
Windows: %APPDATA%\Claude\claude_desktop_config.json
{
"mcpServers": {
"networkx": {
"command": "python",
"args": ["-m", "networkx_mcp"]
}
}
}3. Restart Claude Desktop
The NetworkX tools will now be available in your conversations!
๐งช Test It Works
Ask Claude: "Create a graph called 'test', add nodes 1, 2, 3 with edges between them, then find the shortest path from 1 to 3"
๐ Available Operations
๐ฌ Academic Research Functions
resolve_doi- Resolve DOI to publication metadata using CrossRef APIbuild_citation_network- Build citation networks from seed DOIsanalyze_author_impact- Calculate h-index and impact metrics for authorsfind_collaboration_patterns- Analyze co-authorship networksdetect_research_trends- Identify publication and citation trends over timerecommend_papers- Get paper recommendations based on citation patternsexport_bibtex- Export citation networks in BibTeX format
๐ Core Graph Operations
create_graph- Create directed or undirected graphsadd_nodes/remove_nodes- Add or remove nodesadd_edges/remove_edges- Add or remove edgesget_info- Get basic graph statisticslist_graphs- List all stored graphsdelete_graph- Delete a graph from storageshortest_path- Find optimal paths between nodesget_neighbors- Get all neighbors of a nodeset_node_attributes/get_node_attributes- Manage node metadataset_edge_attributes/get_edge_attributes- Manage edge weights and metadata
๐ Analysis Operations
degree_centrality- Find the most connected nodesbetweenness_centrality- Identify bridges and key connectorscentrality_measures- Multiple centrality metrics at oncepagerank- Google's PageRank algorithm for node importanceconnected_components- Find isolated subgraphscommunity_detection- Discover natural groupingsclustering_coefficients- Measure local clusteringgraph_statistics- Comprehensive graph statisticsminimum_spanning_tree- Find minimum spanning treecycles_detection- Detect cycles in a graphgraph_coloring- Greedy vertex coloringmatching- Maximum weight matchingmaximum_flow- Maximum flow in directed graphstopological_sort- Topological ordering of DAGssubgraph- Extract induced subgraph as new graphmerge_graphs- Compose two graphs into one
๐จ Visualization & I/O
visualize_graph- Create PNG visualizations with multiple layoutsimport_csv- Load graphs from edge listsexport_json- Export graphs in standard formats
Academic Research Example
Human: Analyze citation patterns for the paper "Attention Is All You Need"
Claude: I'll help you analyze citation patterns for that influential paper.
[Resolves DOI: 10.5555/3295222.3295349]
Found paper: "Attention Is All You Need" by Vaswani et al. (2017)
Citations: 82,892 | Journal: NIPS
[Builds citation network from seed DOI]
Built citation network with 847 nodes and 2,341 edges from 2-hop analysis
[Analyzes author impact]
Ashish Vaswani: h-index 45, total citations 127,436
Most impactful paper: "Attention Is All You Need" (82,892 citations)
[Finds collaboration patterns]
Key collaborators: Noam Shazeer (Google), Niki Parmar (Google)
Research cluster: Google Brain team with 47 collaborations
[Detects research trends]
Trend: MASSIVE INCREASE in attention mechanism research post-2017
2017: 12 papers โ 2023: 3,847 papers (320x growth)
[Recommends related papers]
Top recommendations based on co-citation patterns:
1. "BERT: Pre-training of Deep Bidirectional Transformers" (2018)
2. "GPT-2: Language Models are Unsupervised Multitask Learners" (2019)
3. "RoBERTa: A Robustly Optimized BERT Pretraining Approach" (2019)
[Exports BibTeX]
Generated BibTeX file with 847 entries ready for LaTeX integration๐ Academic Use Cases
1. Literature Review & Meta-Analysis
Automatically expand citation networks from key papers
Identify research gaps and emerging trends
Calculate field-wide impact metrics
Generate comprehensive BibTeX databases
2. Collaboration Network Analysis
Map research collaborations within and across institutions
Identify key researchers and potential collaborators
Analyze interdisciplinary connections
Study research community evolution
3. Citation Pattern Analysis
Track knowledge diffusion through citation networks
Identify influential papers and breakthrough research
Analyze citation bias and self-citation patterns
Study geographic and institutional citation patterns
4. Research Trend Detection
Identify emerging research areas and hot topics
Analyze publication volume and citation trends
Track research lifecycle from emergence to maturity
Predict future research directions
5. Academic Impact Assessment
Calculate comprehensive author impact metrics
Compare researchers across different career stages
Analyze journal and conference impact patterns
Study citation half-life and research longevity
๐ Performance
Memory: ~70MB (including Python, NetworkX, and visualization)
Graph Size: Tested up to 10,000 nodes
Operations: Most complete in milliseconds
Visualization: 1-2 seconds for complex graphs
๐ ๏ธ Development
Running from Source
# Clone the repository
git clone https://github.com/Bright-L01/networkx-mcp-server
cd networkx-mcp-server
# Install dependencies
pip install -e ".[dev]"
# Run the server
python -m networkx_mcpRunning Tests
pytest tests/working/๐ Documentation
API Reference - Detailed operation descriptions
Contributing - How to contribute
๐ค Contributing
We welcome contributions! This is the first NetworkX MCP server, and there's lots of room for improvement:
Add more graph algorithms
Improve visualization options
Add graph file format support
Optimize performance
Write more examples
๐ License
MIT License - See LICENSE for details.
๐ Acknowledgments
NetworkX - The amazing graph library that powers this server
Anthropic - For creating the Model Context Protocol
The MCP community - For inspiration and examples
Built with โค๏ธ for the AI and Graph Analysis communities
Available Tools
46 toolsadd_edgesC
Add edges to a graph
Inputs: edges (required), graph (required).
add_nodesC
Add nodes to a graph
Inputs: graph (required), nodes (required).
analyze_author_impactC
Analyze author impact metrics including h-index
Inputs: graph (required), author_name (required).
analyze_workflow_failuresC
Analyze workflow failures with AI-powered insights
Inputs: run_id (required).
betweenness_centralityC
Calculate betweenness centrality for all nodes
Inputs: graph (required).
build_citation_networkC
Build citation network from DOIs using CrossRef API
Inputs: graph (required), seed_dois (required), max_depth.
cancel_workflowC
Cancel a running workflow
Inputs: run_id (required).
centrality_measuresB
Calculate multiple centrality measures (degree, betweenness, closeness, eigenvector)
Inputs: graph (required), measures.
clustering_coefficientsC
Calculate clustering coefficients for all nodes
Inputs: graph (required).
community_detectionC
Detect communities in the graph using Louvain method
Inputs: graph (required).
connected_componentsC
Find connected components in the graph
Inputs: graph (required).
create_graphC
Create a new graph
Inputs: name (required), directed.
cycles_detectionA
Detect cycles in a graph (cycle basis for undirected, DAG check for directed)
Inputs: graph (required).
degree_centralityC
Calculate degree centrality for all nodes
Inputs: graph (required).
delete_graphC
Delete a graph from storage
Inputs: graph (required).
detect_research_trendsC
Detect research trends over time
Inputs: graph (required), time_window.
export_bibtexC
Export citation network as BibTeX format
Inputs: graph (required).
export_jsonA
Export graph as JSON in node-link format
Inputs: graph (required).
find_collaboration_patternsC
Find collaboration patterns in citation network
Inputs: graph (required).
get_dora_metricsB
Get DORA metrics for CI/CD performance
Inputs: no named parameters.
get_edge_attributesC
Get all attributes of an edge
Inputs: graph (required), source (required), target (required).
get_infoD
Get graph information
Inputs: graph (required).
get_neighborsC
Get all neighbors of a node
Inputs: node (required), graph (required).
get_node_attributesC
Get all attributes of a node
Inputs: node (required), graph (required).
get_workflow_statusC
Get CI/CD workflow status
Inputs: run_id.
graph_coloringC
Color graph vertices using greedy algorithm
Inputs: graph (required), strategy.
graph_statisticsB
Calculate comprehensive graph statistics (density, diameter, degree distribution)
Inputs: graph (required).
import_csvB
Import graph from CSV edge list (format: source,target per line)
Inputs: graph (required), csv_data (required), directed.
list_graphsB
List all stored graphs with summary info
Inputs: no named parameters.
matchingC
Find maximum weight matching in a graph
Inputs: graph (required), max_cardinality.
maximum_flowC
Calculate maximum flow in a directed graph
Inputs: sink (required), graph (required), source (required), capacity.
merge_graphsB
Compose two graphs into a new graph (union of nodes and edges)
Inputs: graph_a (required), graph_b (required), new_graph (required).
minimum_spanning_treeC
Find minimum spanning tree of an undirected graph
Inputs: graph (required), weight, algorithm.
pagerankC
Calculate PageRank for all nodes
Inputs: graph (required).
recommend_papersC
Recommend papers based on citation network analysis
Inputs: graph (required), seed_doi (required), max_recommendations.
remove_edgesC
Remove edges from a graph
Inputs: edges (required), graph (required).
remove_nodesC
Remove nodes from a graph
Inputs: graph (required), nodes (required).
rerun_failed_jobsC
Rerun failed jobs in a workflow
Inputs: run_id (required).
resolve_doiB
Resolve DOI to publication metadata using CrossRef API
Inputs: doi (required).
set_edge_attributesC
Set attributes on one or more edges
Inputs: graph (required), attributes (required).
set_node_attributesC
Set attributes on one or more nodes
Inputs: graph (required), attributes (required).
shortest_pathC
Find shortest path between nodes
Inputs: graph (required), source (required), target (required).
subgraphB
Extract an induced subgraph and store it as a new graph
Inputs: graph (required), nodes (required), new_graph (required).
topological_sortB
Return a topological ordering of a directed acyclic graph
Inputs: graph (required).
trigger_workflowC
Trigger a GitHub Actions workflow
Inputs: workflow (required), branch, inputs.
visualize_graphC
Create a visualization of the graph
Inputs: graph (required), layout.
Tool Schema Changelog
Recent tool additions, removals, and schema changes observed during successful MCP inspections.
Loading tool schema changelogโฆ
TDQS
Scored across 46 tools
Multiple tools have overlapping purposes (degree_centrality, betweenness_centrality, and centrality_measures all compute centrality metrics). The inclusion of unrelated domains (citation analysis, CI/CD workflows) alongside graph operations creates significant confusion about tool selection for an agent.
Most tools follow a clear verb_noun snake_case pattern (create_graph, add_edges, delete_graph, trigger_workflow), but a few deviate (pagerank, subgraph, matching, topological_sort). Overall the convention is consistent and readable.
With 46 tools spanning three very different domains (NetworkX graphs, citation networks, CI/CD workflows), the server is excessively large and unfocused. Each domain individually would warrant a smaller, dedicated tool set; combining them makes the count inappropriate.
The graph operations lack obvious essentials such as listing edges or updating graph structure. The citation and CI/CD domains appear arbitrarily bolted on, and while each has some coverage, the overall surface is incomplete for any single coherent purpose.
Maintenance
Related MCP Connectors
A comprehensive Model Context Protocol (MCP) server that enables AI assistants to interact with yoโฆ
A Model Context Protocol server for Wix AI tools
Repository knowledge graph MCP server for codebase understanding and debugging.
A comprehensive Model Context Protocol (MCP) server that enables AI assistants to control Unreal Eโฆ
Related MCP Servers
- AlicenseBqualityDmaintenanceA Model Context Protocol server implementation that enables LLMs to interact with NebulaGraph database for graph exploration, supporting schema understanding, queries, and graph algorithms.529Apache 2.0

Graphistry MCPofficial
AlicenseAqualityDmaintenanceGPU-accelerated graph visualization and analytics server for Large Language Models that integrates with Model Control Protocol (MCP), enabling AI assistants to visualize and analyze complex network data.1717 npm12MIT- AlicenseNot gradedqualityDmaintenanceA Model Context Protocol server implementing Graph RAG with local, embedded Knowledge Graph using FAISS for vector search and NetworkX for graph traversal, enabling hybrid retrieval through anchor discovery and relationship expansion.2MIT
- FlicenseAqualityDmaintenanceA Model Context Protocol server that enables running Cypher queries and retrieving schema from Neo4j databases, supporting AI-driven graph exploration and text-to-Cypher workflows.3-