Skip to main content
Glama
Sign In
genpark-minimum-spanning-tree-kruskal-prim-skill

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

Official
by alphaparkinc
OverviewSchemaSourceRelated ServersDiscussionsAdmin
Python
Local

Related Servers

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

No user-submitted related servers found.

    Related Servers

    • genpark-maximum-flow-edmonds

      Alpha-Park
      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
    • genpark-topological-sorter-tarjan-scc-skill

      genpark-topological-sorterofficial

      alphaparkinc
      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
    • genpark-maximum-flow-edmonds-karp-network-skill

      genpark-maximum-flow-edmondsofficial

      alphaparkinc
      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
    • genpark-page-rank-power-iteration-centrality-skill

      genpark-page-rank-powerofficial

      alphaparkinc
      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

    • genpark-topological-sorter

      Alpha-Park
      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

    This server cannot be deployed

    One endpoint for every MCP toolRayrun runs every MCP server behind one URL and holds the credentials. Each call is decided per client, tool, and argument, then recorded.ray.runAd

    Resources