\setcounter{AlgoLine}{0}
\DontPrintSemicolon
\KwData{Undirected connected network $R = (V, E, w)$}
	\KwResult{Minimum spanning tree $T = (V, E_T)$}
	Sort and renumber the edges by nondecreasing weight
	 $w(e_1) \leqslant w(e_2) \leqslant \dots \leqslant w(e_{|E|})$\\
	$E_T = \varnothing$\\
	\For{$k = 1 \dots |E|$}
	{\If {$E_T \cup \{e_k\}$ has no cycle}{$E_T \leftarrow E_T \cup \{e_k\}$}
	}

