\setcounter{AlgoLine}{0}
\DontPrintSemicolon
	\KwData{Directed Network $R = (V, E, w)$ with  $w(e) \geqslant 0\ \forall e \in E$, given by successor lists $succ(i)$ for each vertex $i \in V$, a given vertex $s$}
	\KwResult{Immediate predecessor $pred_j$ of $j$ on a shortest path from $s$ to $j$, $\forall j \in V$ and length $\lambda_j$ of the shortest path from $s$ to $j$}
	\ForAll{Vertex $i \in V$}
	{$\lambda_i \leftarrow \infty$ \\ 
		$pred_i \leftarrow \varnothing$ 
	}
	$\lambda_s = 0$\\
	$L \leftarrow V$ \tcp*[r]{Vertices for which the shortest path is not definitive}
	\Repeat{$L \ne \varnothing$}
	{\lnl{line:dijkstra_remove}Remove vertex $i$ with smallest  $\lambda_i$ value from $L$\\
		\ForAll {Vertices $j \in succ(i)$}
		{\If{$j \in L$ and $\lambda_j > \textcolor{myevidence}{\lambda_i~+~}w(i, j)$}
			{\lnl{line:dijkstra_update}$\lambda_j \leftarrow \textcolor{myevidence}{\lambda_i~+~}w(i, j)$\\
				$pred_j \leftarrow i$
			}
		}
	}

