Fackyyj loves the challenge phase in TwosigmaCrap(TC). One day, he meet a task asking him to find shortest path from vertex 1 to vertex n, in a graph with at most n vertices and m edges. (1 ≤ n ≤ ...

optimal 8 directional path, much faster than A* http://users.cecs.anu.edu.au/~dharabor/data/papers/harabor-grastien-aaai11.pdf gives optimal solutions, but can be ...