Skip to main content
Glama
dijkstra-mcp-server

dijkstra-mcp-server

by BNJ02

Related Servers

Alternatives to dijkstra-mcp-server

No user-submitted related servers found.

    Related Servers

    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables 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.
      7
      MIT
    • A
      license
      Not graded
      quality
      Not graded
      maintenance
      Enables 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.
      MIT
    • A
      license
      Not graded
      quality
      Not graded
      maintenance
      Enables agents to compute optimal multi-agent communication backbones and other graph operations such as shortest paths, topological sorting, maximum flow, and centrality ranking via the Model Context Protocol.
      MIT
    • A
      license
      Not graded
      quality
      Not graded
      maintenance
      Enables agents to resolve dependencies and analyze directed graphs through topological sorting, strongly connected components, shortest paths, maximum flow, minimum spanning trees, and centrality ranking via MCP.
      MIT
    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables 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.
      7
      MIT