Hello, I use graph-tool to do some routing tasks over graphs ranging from 1M to 10M edges. To search shortest paths might be quite time consuming. Hence, I wonder if it might be a good idea to try to implement Hierarchical Contractions [1] in graph tool.
What is your opinion about it ? Regards, Fran [1] https://en.wikipedia.org/wiki/Contraction_hierarchies
_______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
