[GraphHopper] Extract a single edge?

[Peter K]

Why not use the extraction provided by Path4CH and iterate over the 
resulting original edge ids?

The extraction is very tedious but simple. See Path4CH.expandEdge: one 
shortcut stores its two edges which it skips. Then apply this 
extraction recursively because a shortcut can have shortcuts itself as 
skipped edges.

Then only the order of how it should be added to the resulting list is 
a matter of some ifs ;)

Regards,
Peter.

> Hi,
>
> I have an algorithm which returns some edges in a list. Since i am
> using contraction hierarchies, these edges are contracted. Is there a
> way to just unfold one single edge to the original graph? In detail
> please, because i cannot follow the code in PathBidirRef.java ! I'm sorry.
>
> I used dijkstrabi for contracting the graph. My aim is to write a
> helper method called HashSet<EdgeIteratorState>
> extractEdge(EdgeIteratorState contrEdge, GraphHopper g);
>
> Thanks,
> Andreas
>
> p.s. i am using a version from a view month ago. i changed too much to
> be able to merge with the master branch again. I hope there are no
> brand new classes or methods which are able to do what i try to achieve.
>
>
> _______________________________________________
> GraphHopper mailing list
> GraphHopper at openstreetmap.org
> https://lists.openstreetmap.org/listinfo/graphhopper