I'm trying to use this routing framework with a self-built graph but I'm having issues using the CCHAdapter. The other adapters are working fine. The issue I'm getting is that in CCHMetric.buildMinimumWeightedGraph() the assertion that a lower triangle is found for each shortcut is not correct.
So I'm wondering if there are special requirements for the graph when using the CCHAdapter?
- Are dangle edges allowed?
- Are traversal costs of
INFTY allowed? If not, how do I close edges for an iteration step?
- To model turn restrictions/costs, the intersections are exploded so that each edge is split into a incoming and an outgoing edge
purple: directed link, blue: turn
Any hints welcome...
I'm trying to use this routing framework with a self-built graph but I'm having issues using the
CCHAdapter. The other adapters are working fine. The issue I'm getting is that inCCHMetric.buildMinimumWeightedGraph()the assertion that a lower triangle is found for each shortcut is not correct.So I'm wondering if there are special requirements for the graph when using the
CCHAdapter?INFTYallowed? If not, how do I close edges for an iteration step?purple: directed link, blue: turn
Any hints welcome...