minimum-spanning-tree

Name: minimum-spanning-tree
Availability: InStock
Author: SPIRAL-EDWIN

Community

Efficient MST solver for network design.

Software Engineering #graph-theory #network-design #minimum-spanning-tree #Prim's-algorithm #Kruskal's-algorithm #algorithm-visualization

AuthorSPIRAL-EDWIN

Version1.0.0

Installs0

System Documentation

What problem does it solve?

Find a minimum-weight spanning tree for a weighted undirected graph.

Core Features & Use Cases

Prim's algorithm implementation for dense graphs
Kruskal's algorithm implementation for sparse graphs
Applications: network design, circuit layout, clustering

Quick Start

Compute the MST for a given weighted undirected graph and return the MST edges with their weights and the total weight.

Dependency Matrix

Required Modules

None required

Components

Standard package

💻 Claude Code Installation

Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.

Please help me install this Skill:
Name: minimum-spanning-tree
Download link: https://github.com/SPIRAL-EDWIN/MCM-ICM-2601000/archive/main.zip#minimum-spanning-tree

Please download this .zip file, extract it, and install it in the .claude/skills/ directory.

View Source Repository

Agent Skills Search Helper

Install a tiny helper to your Agent, search and equip skill from 223,000+ vetted skills library on demand.