Skip to main content
Glama
Alpha-Park

genpark-graph-dijkstra-astar-pathfinder-skill

Official
by Alpha-Park

Related Servers

Alternatives to genpark-graph-dijkstra-astar-pathfinder-skill

No user-submitted related servers found.

    Related Servers

    • A
      license
      Not graded
      quality
      B
      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.
      7
      MIT
    • 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
      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
    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables MCP clients to run zero-dependency graph algorithms—including topological sorting, strongly connected component detection, shortest paths, maximum flow, minimum spanning trees, and PageRank—for agent dependency resolution and execution planning.
      7
      MIT
    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables MCP clients to compute shortest paths, topological dependency orderings, maximum network flows, minimum spanning trees, and PageRank-style centrality over graph topologies using only the Python standard library. It supports optimal multi-agent communication backbone and execution-plan analysis without external graph dependencies.
      7
      MIT