Skip to main content
Glama
alphaparkinc

genpark-minimum-spanning-tree-kruskal-prim-skill

Official

Related Servers

Alternatives to genpark-minimum-spanning-tree-kruskal-prim-skill

No user-submitted related servers found.

    Related Servers

    • 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 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 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.
      7
      MIT
    • 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