Algorithm 1 Segment reunification strategy.

Require:  Road Network file, edges files Ensure:  Reunified segment file 1:$edgeConnectedNoIntersection\left[\right]\leftarrow$ dictionary that stores all edges without intersections 2:for all edge in Road Network file do 3:    $edge\_id\leftarrow$ store the edge id of the road network file 4:    $connections\left[\right]\leftarrow$ dictionary that stores all connections for that edge id 5:    for all connection in Road Network file do 6:        $connection\_from\leftarrow$ store the edge id(from) of the road network file 7:        $connection\_to\leftarrow$ store the edge id(to) of the road network file 8:        if $(connection\_from=edge\_id)$ and $(connection\_to\mathbf{not}\mathbf{in}connections)$ then 9:           $connections[edge\_id]\leftarrow connection\_to$ 10:       end if 11:   end for 12:   if $edge\_id$ partition = TRUE then 13:       $lenEdgeConnect\leftarrow$ length of dictionary in a specific edge id 14:       $street\_id\leftarrow$ code of the street 15:       for $i=0$ to $length\left(connections\right[edge\_id\left]\right)$ do 16:          if $(lenEdgeConnect=1)$ and $\left(connections\right[edge\_id\left]\right[i]$ partition = TRUE) and $(street\_id\mathbf{in}edge\_id)$ and $(street\_id\mathbf{in}connections[edge\_id\left]\right[i\left]\right)$ then 17:              $edgeConnectedNoIntersection[edge\_id]\leftarrow connections[edge\_id]\left[i\right]$ 18:          else 19:              $edge\_id\leftarrow$ has some intersecting segments, cannot reunify 20:          end if 21:       end for 22:   else 23:       $edge\_id\leftarrow$ is not split, reunification is unnecessary 24:   end if 25:end for