Steve Yegge
Steve Yegge
O(m+n) would be fantastic. You could just precompute all shortest paths and be O(1) on every query. I'm finding that shortest-path queries are taking 3-6 seconds, though fortunately most are...
That would be nice. It was somewhat nontrivial to figure out how to use the API. My code looks like this: val edges = getAlgorithm(graph).getPath(a, b) if (edges.size == 0)...