HF RL Explorer

Maximum Spanning Tree Implementation

Maximum Spanning Tree Implementation: a task in Terminal-Lego-15k (Harbor dataset). Implement an algorithm to find the Maximum Spanning Tree (MaxST) of a weighted undirected graph.

The task

Implement an algorithm to find the **Maximum Spanning Tree (MaxST)** of a weighted undirected graph.

Part of PrimeIntellect/Terminal-Lego-15k.