Algorithm 2 Spatial and Temporal Matching Algorithm
Input:	HCTPlist Pi, Pi+k; CandidateList $c_i^1$, $c_i^2$ … $c_i^j$; Trajetory Pi+1 → Pi+2 … → Pi+k
Output:	OSM-WayID-List;
1:	Initialize OSM-WayID-List as empty list;
2:	for each $c_i^1$ and $c_{i+k}^1$ do
3:	F($c_i^1$) = 1;
4:	F($c_{i+k}^1$) = 1;
5:	end for
6:	for t = i + 1 to i + k − 1 do
7:	max = −∞;
8:	for s = 1 to candidateList(Pt).count do
9:	F($c_t^s$) = F($c_{t-1}^j$) + F($c_{t-1}^j$ → $c_t^s$);
10:	Alt = F($c_t^s$);
11:	if (Alt > max) then
12:	max = Alt;
13:	C = max. $c_t^s$;
14:	end if
15:	end for
16:	OSM-WayID-List.add(C.id);
17:	end for