Re: [jgrapht-users] TransitNodeRoutingShortestPath
Brought to you by:
barak_naveh,
perfecthash
From: John S. <js...@gm...> - 2021-02-15 06:02:59
|
Thanks, I've asked the author of the algorithm to take a look! On Sun, Feb 14, 2021 at 11:19 PM Mario Basa <mar...@gm...> wrote: > Will a CSV file of the graph that contains the ID,SOURCE,TARGET,COST be > usable? > > Thanks. > > Mario. > > > On Sun, Feb 14, 2021 at 5:26 PM John Sichi <js...@gm...> wrote: > >> Could you create an issue in github? But before someone can look into >> it, it'll be necessary to have access to the data (or better, a small >> subset which reproduces the issue). If you can't provide the data, then >> the second best would be to provide output from a CPU profiler showing >> where the time is being spent. >> >> On Fri, Feb 12, 2021 at 12:56 AM Mario Basa <mar...@gm...> wrote: >> >>> Greetings, >>> >>> I have been trying to use the TransitNodeRoutingShortestPath on a graph >>> that contains the OSM road network of Switzerland (474,687 edges) since >>> the documentation says that this algorithm is most suited for large >>> networks. >>> >>> For some reason though, everytime pre-computation is performed, the CPU >>> usage jumps to 350% continuously and I had to stop the process after 3 >>> hours of processing since obviously there was something wrong. It took only >>> around 3 minutes to do a pre-computation using the ContractionHierarchyBidirectionalDijkstra >>> algorithm using the very same graph. >>> >>> My code is: >>> >>> *private* *static* TransitNodeRoutingShortestPath<Integer, >>> >>> LabeledWeightedEdge> *tnrsp* = *null*; >>> >>> >>> ThreadPoolExecutor executor = >>> >>> (ThreadPoolExecutor) Executors. >>> *newFixedThreadPool*(3); >>> >>> >>> >>> *tnrsp* = *new* TransitNodeRoutingShortestPath<Integer, >>> >>> LabeledWeightedEdge>(*defaultGraph*,executor); >>> >>> >>> >>> *tnrsp*.performPrecomputation(); >>> >>> >>> >>> I tried increasing the ThreadPool but I got the same result (high CPU >>> usage and un-ending processing). >>> >>> >>> Is there anything I am doing wrong? I'd really appreciate it if someone >>> can point out how to properly use this algorithm. >>> >>> >>> Thanks. >>> >>> >>> >>> Mario >>> >>> >>> _______________________________________________ >>> jgrapht-users mailing list >>> jgr...@li... >>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users >>> >> |