Skip to main content

Table 1 Shortest path between some potential points

From: A map-matching algorithm with low-frequency floating car data based on matching path

ID of potential points ID of potential points No. of sections ID of the section ID of the section ID of the section ID of the section ID of the section ID of the section ID of the section Length of the shortest path
00 10 5 366206807 366206805 366206803 366206801 366206700    1045
00 11 6 366206807 366206805 366206803 366206801 366200490 366200492   1494
01 10 7 366200485 366200487 366200488 366206489 366206490 366206689 366206700 1587
01 11 6 366200485 366200487 366200488 366206489 366200490 366200492   1248
02 10 6 366206808 366206807 366206805 366206803 366206801 366206700 1376
02 11 7 366206808 366206807 366206805 366206803 366206801 366200490 366200492 1794
10 20 5 366206700 366206701 366206703 366209263 366209264    985
11 20 6 366200492 366200495 366200496 366200497 366209263 366209264   1183
20 30 5 366209264 366209265 366209266 366209268 366209269    873
20 31 6 366209264 366209265 366209266 366209268 366209269 366209387   997
20 32 5 366209264 366209265 366209266 366209268 366209269 366209375 366209376 1034
30 40 6 366209269 366209387 366209388 366209389 366209397 366209398   1432
31 40 5 366209387 366209388 366209389 366209397 366209398    1147
32 40 6 366209376 366209377 366209378 366209379 366209380 366209397 366209398 1391
40 50 6 366209398 366209399 366209340 366209341 366204751 366204752   897
40 51 7 366209398 366209399 366209340 366209341 366204751 366204752 1268
40 52 7 366209398 366209399 366209340 366209341 366204751 366204752 366207948 1325