HF RL Explorer

Minimum Spanning Tree with Negative Edge Weights

Minimum Spanning Tree with Negative Edge Weights: a task in Terminal-Lego-15k (Harbor dataset). This task explores whether Minimum Spanning Tree (MST) algorithms can handle graphs with negative edge weights, unlike shortest path algorithms which have problems with negative weights.

The task

This task explores whether Minimum Spanning Tree (MST) algorithms can handle graphs with negative edge weights, unlike shortest path algorithms which have problems with negative weights.

Part of PrimeIntellect/Terminal-Lego-15k.