\setcounter{AlgoLine}{0}
\DontPrintSemicolon
	{\KwIn{Undirected graph $G = (V, E);$}
		\KwResult{Vertex colouring}
		Colour with $1$ the vertex $v$ with the highest degree\\
		$R \leftarrow V \setminus v$\\
		$colours \leftarrow 1$\\
		\While{$R \neq \varnothing$}
		{$ \forall v \in R$, compute $DS(v)$\\
			Choose $v'$ maximizing $DS(v')$, with the highest possible degree\\
			Find the smallest $k$ ($1 \leqslant k \leqslant colours + 1$) such that colour $k$ is feasible for $v'$\\
			Assign colour $k$ to $v'$\\
			\If{$k > colours$}
			{$colours = k$}
			$R \leftarrow R \setminus v'$\\
		}
	}

