search

kit-algo / InertialFlowCutter

C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.
BSD 3-Clause "New" or "Revised" License
12 stars 15 forks source link

InertialFlowCutter for random network #7

Closed rahelehzarei closed 4 years ago

rahelehzarei commented 4 years ago

Hi

how can I use InertialFlowCutter to order nodes of a random generate graph (it's not a map that contains latitude and longitude created by SUMO (Simulation of Urban Mobility))

Thanks

larsgottesbueren commented 4 years ago

Hi,

InertialFlowCutter is explicitly designed for road graphs (which come with coordinates). They don't have to be lat/long, any 2D coords should work. I think we don't do any stuff that relies on certain value ranges (not 100% sure though). If you have something grid-like or an embedding of some sort, that should work. If not, you can still use plain FlowCutter, which doesn't need any coordinates but is somewhat slower.

Could you elaborate on your application?

Best, Lars

larsgottesbueren commented 4 years ago

Closing, since no further response.