Nicheloom

Market intelligence for builders — see what's gaining traction before it's crowded.

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

Minimum Spanning Tree (MST) solver using Kruskal's disjoint-set union-find for optimal multi-agent communications backbones.

Details

External ID
1391750395
Source
GITHUB
Company
—
Product
genpark-minimum-spanning-tree-kruskal-prim-skill
Website domain
github.com
Launched
Sept. 28, 2026
Cohort
—
Upvotes
7
Upvotes percentile
0.05976172175249808
Tags
agentic-ai, graph-algorithms, kruskal, mcp, mcp-server, minimum-spanning-tree, model-context-protocol, mst, network-topology, union-find, zero-dependency
Fetched at
Sept. 30, 2026, 1:02 a.m.
Updated at
Sept. 30, 2026, 1:02 a.m.

Enrichment

Theme
autonomous agent research and evaluation
Vertical
Horizontal
Function
Dev tools
Audience
Developer
AI stance
Not AI
Project type
Hobby / open-source project
Normalized one-liner
minimum spanning tree solver for network routing
Manually corrected
False

Could you build this?

Yes Kruskal's and Prim's algorithms using disjoint-set union-find are standard computer science algorithms that LLMs write accurately on demand.

Competitors

Other products that read as similar to this one — 871 launches clear the similarity bar, closest 8 shown.

Attention rank: #667 of 872 (itself plus its competitors, highest first — normalized so YC and Product Hunt are compared fairly).

Launched 332 days after the earliest competitor.

Other launches for this product

Same idea, different domain

Nobody's really built a dev tools tool for Sales yet.