Algorithm 1. Computing the 0–1 covering matrix.

Input: $\mathit{V}\mathbf{=}\mathbf{\{}{\mathit{I}}_{\mathbf{1}}\mathbf{,}{\mathit{I}}_{\mathbf{2}}\mathbf{,}\mathbf{\dots }{\mathit{I}}_{\mathit{n}}\mathbf{\}}$ , ${\mathit{G}}_{\mathbf{1}}\mathbf{=}({\mathit{V}}_{\mathbf{1}}\mathbf{,}{\mathit{E}}_{\mathbf{1}})$ , delay $\mathit{\tau }$

Output: $\mathit{T}(\mathit{m}\mathbf{\times }\mathit{n})$

1: Double dist[N];

2: For int $\mathit{i}\mathbf{=}\mathbf{1}$ to $\mathit{n}$

3: Dijkstra (${\mathit{G}}_{\mathbf{1}}$, dist,${\mathit{I}}_{\mathit{i}}$);

4: For int $\mathit{j}\mathbf{=}\mathbf{1}$ to $\mathit{m}$

5: Compute ${\mathit{t}}_{\mathit{j}\mathit{i}}$ according to Formula (6);

6: If (${\mathit{t}}_{\mathit{j}\mathit{i}}\mathbf{\le }\mathit{\tau }$)${\mathit{T}}_{\mathit{j}\mathit{i}}\mathbf{=}\mathbf{1}$;

7: Else if (${\mathit{t}}_{\mathit{j}\mathit{i}}\mathbf{>}\mathit{\tau }$)${\mathit{T}}_{\mathit{j}\mathit{i}}\mathbf{=}\mathbf{0}$;

8: End for

9: End for