Skip to main content
Glama
Alpha-Park

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

by Alpha-Park
OverviewSchemaSourceRelated ServersDiscussionsAdmin
Python
Remote

Related Servers

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

No user-submitted related servers found.

    Related Servers

    • genpark-page-rank-power

      Alpha-Park
      A
      license
      Not graded
      quality
      B
      maintenance
      Enables graph analysis and network-flow computations through the Model Context Protocol, including shortest-path search, topological dependency resolution, maximum flow, minimum spanning trees, and PageRank centrality scoring for interconnected agent networks.
      7
      MIT

    • genpark-topological-sorter

      Alpha-Park
      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
    • genpark-graph-dijkstra-astar-pathfinder-skill by alphaparkinc

      genpark-graph-dijkstra-astarofficial

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

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

      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

    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

    Maintenance

    ActivityMaintained
    ResponsivenessNo issues

    Resources