I think we made some progress in simplifying the low level API that is now a bit less entangled with OSM specific stuff. You can always just create a graph, set some properties / encoded values for the different edges and use some weighting and all of GraphHopper’s algorithms to calculate shortest paths. But without any details about the specific data you have in mind it is hard to give advice.