Algorithm 2: The paths()algorithm to find possible intruder paths.
	Data: s,p,tmin,tmax,TU,NU,tf,S,P(S)
1	Γ ← adjacentNodes(s(|s|), G)); l ← |Γ|
2	while l > 0 do
3	${T^{\prime }}_{\mathit{max}}\left(l\right)\leftarrow t_{\mathit{max}}+\frac{d_{s\left(\left|s\right|\right),\Gamma \left(l\right)}}{\mathit{min}\left({\upsilon }_{\mathit{\text{int}}}\right)}$
4	for (tU, nU) ∈ (TU, NU) do
5	if Γ(l) = nU then
6	if ${T^{\prime }}_{\mathit{max}}\left(l\right)\le t_U$then
7	Γ ← Γ \ {Γ(l)}
8	${T^{\prime }}_{\mathit{max}}\leftarrow {T^{\prime }}_{\mathit{max}}\backslash \left\{{T^{\prime }}_{\mathit{max}}\left(l\right)\right\}$
9	break
10	l ← (l — 1)
11	for l ← 1 to |Γ| do
12	$s^{\prime }\leftarrow \left[s\Gamma \left(l\right)\right];p^{\prime }\leftarrow p\times \frac{1}{|\Gamma |}$
13	${t^{\prime }}_{\mathit{min}}\leftarrow t_{\mathit{min}}+\frac{d_{s\left(\left|s\right|\right),\Gamma \left(l\right)}}{\mathit{max}\left({\upsilon }_{\text{int}}\right)}$
14	if ${t^{\prime }}_{\mathit{min}}\ge t_f$then
15	S ← S ∪ {s′}; P(S = s′) ← p′
16	else
17	(S,P(S)) ← paths $\left(s^{\prime },p^{\prime },{t^{\prime }}_{\mathit{min}},{T^{\prime }}_{\mathit{max}}\left(l\right),T_U,N_U,t_f,S,P\left(S\right)\right)$
	Result: S,P(S)