[22:25] <pikhq> http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
[22:27] <cherez> Actually, I think that might be polynomial.
[22:27] <cherez> A huge polynomial, but polynomial all the same.
[22:29] <cherez> No, that's nonpolynomial.
[22:30] <cherez> O(((n^2)^n)^2)
[22:30] <pikhq> Jebus.
[22:30] <Deformative> Oh well.
[22:30] <Deformative> The generated apps should be ridiculously fast.
[22:30] <cherez> Let's see, at each step there are O(n^2) branches, and there are at most O(n) steps.
[22:32] <cherez> So O(n^(2n)) total branches.
[22:32] <cherez> Thus as many vertices.