# Definition:Spanning Tree/Building-Up Method

Start with the edgeless graph $N$ whose vertices correspond with those of $G$.
Select edges of $G$ one by one, such that no cycles are created, and add them to $N$.