You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi, I'd like to try out the CCH functionality, but my graph does not include longitudes and latitudes (it's a knowledge graph built from the DBPedia dataset, instead of a geospatial graph). I could use the CH interface without needing longs/lats, but the nested dissection algorithm requires long and lat vectors. I'm not clear if they are truly required for the algorithm to work. Is it possible to use the CCH functionality with a generic graph? Thanks for your help.
The text was updated successfully, but these errors were encountered:
Hi,
CCH works with any graph. It is fast iff the graph has small recursive
balanced separators. Only the partitioning algorithm included in
RoutingKit needs lat/lon.
You can look at https://github.com/kit-algo/flow-cutter for other ways
of computing the node order that does not require lat/lon. However, the
interface there is not as polished as RoutingKit.
Best Regards
Dr. Ben Strasser
Hi, I'd like to try out the CCH functionality, but my graph does not include longitudes and latitudes (it's a knowledge graph built from the DBPedia dataset, instead of a geospatial graph). I could use the CH interface without needing longs/lats, but the nested dissection algorithm requires long and lat vectors. I'm not clear if they are truly required for the algorithm to work. Is it possible to use the CCH functionality with a generic graph? Thanks for your help.
The text was updated successfully, but these errors were encountered: