F
licenseNot graded
qualityC
maintenanceEnables LLM agents to compute shortest paths and all-destination distances on undirected weighted graphs provided as simple text edge lists, returning optimal routes, total costs, and segment details.
-
seminar2
by JonHHH09
Related Servers
Alternatives to seminar2
No user-submitted related servers found.
Related Servers
- AlicenseNot gradedqualityAmaintenanceEnables structural knowledge-graph code search, AST snippet retrieval, architecture analysis, call-path tracing, and textual code search across indexed repositories, plus an auto-started graph visualization UI.158 npm1MIT
- AlicenseNot gradedqualityBmaintenanceEnables agents to compute shortest paths, topological orderings, maximum flow and minimum cut bottlenecks, minimum spanning trees, and centrality rankings for graph-based multi-agent routing. It runs as a zero-dependency MCP server using standard Python libraries.7MIT
- AlicenseNot gradedqualityBmaintenanceEnables agents to compute shortest paths, topological dependency order, maximum flow and minimum-cut bottlenecks, minimum spanning trees, and PageRank centrality over weighted graphs for routing and execution planning. It exposes these graph-analysis capabilities as MCP tools through a zero-dependency Python server.7MIT
- AlicenseNot gradedqualityBmaintenanceEnables coding agents to query a precise, local call/type/data graph so they can find who calls what, what breaks when code changes, and which tests to run, with every answer traced to file:line.1Functional Source , Version 1.1, ALv2 Future
- AlicenseNot gradedqualityBmaintenanceEnables graph pathfinding and network analysis through MCP, including Dijkstra/A* shortest paths, topological dependency resolution, maximum flow, minimum spanning trees, and PageRank centrality for agent planning.7MIT
This server cannot be deployed
Maintenance
ActivityMaintained
ResponsivenessNo issues