← Directi questions

Convert graph to tree

Filed under Directi · Also reported at Moonfrog Labs

The question

Given a connected graph with n-1+k edges (k < 10), remove the most weighted set of edges to convert it into a tree.

No write-up yet. Related questions below have one.

Related Directi questions

Collected from public candidate posts and coding forums. Updated Nov 2026.