Hi. I hope this is a right question to ask here. I’m doing a simulation of vehicle transportation. So during each round, I need to use shortest-path-algorithm to find the route with the shortest traveling time. In this process, there are cases where the shortest travel time found is Inf, while in real case, it is rather rare, right? Or maybe if one location is in an island, and the other one is in the other island, then they are not reachable from one another? Or maybe it’s because the map data is limited, and if one or two locations are near the boundary, then they are not reachable from each other? I was thinking to ignore this travel-time-being-Infinity cases, and re-choose either the round locations or the route. Are there any better suggestions then?
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Got route distance 0 between two different GPS locations? | 0 | 261 | October 25, 2019 | |
| Get route length 0 wile trying to caculate route between two given locations using package OpenStreetMapX | 0 | 270 | October 23, 2019 | |
| What does it mean when yen_k shows only one route? | 11 | 403 | May 1, 2023 | |
| Graph.jl : How to interpret the output information returned by the shortest path algorithms? | 10 | 1148 | February 17, 2023 | |
| Networkx & lightgraphs.jl shortest path benchmark | 7 | 4115 | May 11, 2020 |