Table - PMC

Skip to main content

View full-text article in PMC

. 2023 Jan 31;23(3):1556. doi: 10.3390/s23031556

Algorithm 2: SLE for SPA preparation

1:
Input: $G_{P} = (N_{P}, E_{P}), L_{i, j}$ of all $E_{P}$
2:
Output: $S P A$
3:
Set,
- $S N$ : source node
- $D N$ : destination node
- K: the number of shortest paths between $S N$ and $D N$
- $P_{u}$ : a path from $S N$ to u
- $S P A$ : a heap structure keeps paths
- P: set of shortest paths from $S N$ and $D N$
- $c o u n t u$ : number of shortest paths for node u
4:
Initialize, $P = e m p t y, c o u n t u = 0, L = 0$
5:
for all u node in $N_{P}$ do
6:
Insert path $P_{S N} = S N$ into $S P A$ with cost 0
7:
end for
8:
while $S P A x x x e m p t y & & c o u n t D N < K$ do
9:
$S P A = S P A - P u$
10:
$c o u n t u + +$
11:
if $u = D N$ then
12:
$P = P U P u$
13:
end if
14:
if $c o u n t u w w w K$ then
15:
for each $E_{P}$ adjacent to node u do
16:
$P_{v}$ new path with $L = L + L_{i}, u$
17:
Insert $P_{v}$ into SPA
18:
end for
19:
end if
20:
end while
21:
return $S P A$