sagemath-mcp
Related Servers
Alternatives to sagemath-mcp
No user-submitted related servers found.
Related Servers
- AlicenseNot gradedqualityBmaintenanceEnables graph analysis over interconnected agent networks by computing centrality and authority scores, shortest paths, dependency orderings, maximum flows, and minimum spanning trees through MCP tools.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 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 with Dijkstra and A*, resolve DAG dependencies, solve maximum flow, build minimum spanning trees, and rank graph centrality using JSON-RPC MCP tools.7MIT
- AlicenseNot gradedqualityDmaintenanceExposes the full SageMath computer algebra system to LLM clients through MCP tools for symbolic mathematics, solving, calculus, plotting, and number theory.80 npm1Creative Commons Zero v1.0 Universal
- AlicenseAqualityBmaintenanceRuns a local, read-only knowledge graph over MCP, enabling graph queries, path finding, explanations, neighbor exploration, statistics, and god-node discovery without cloud dependencies.10Apache 2.0
TDQS
Scored across 16 tools
The tools cover overlapping graph-theoretic concepts (e.g., is_efec, is_efec_cubic_brick, has_cyclic_edge_cut, cyclic_edge_connectivity all relate to edge connectivity), which may cause some misselection. However, each tool has a distinct focus and the descriptions are detailed enough to clarify most differences.
Most tools follow a clear snake_case pattern with prefixes like is_, has_, classify_, list_, identify_, run_. A few outliers like cyclic_edge_connectivity and graph_info are noun phrases rather than verb phrases, creating a slight inconsistency but not a major one.
16 tools is slightly above the ideal 3-15 range but still reasonable for a specialized graph analysis server. The tools cover a broad set of related properties without being excessively redundant.
The tool set covers many graph properties and includes run_sage for arbitrary computations, making it functionally complete. However, there are some specific checks (e.g., near-bipartite, brick, efec) that are covered, but not all possible graph invariants, so it is not exhaustive.