Talk:UVa 10917 - Walk Through the Forest

Hi everyone.

I feel so strange after reading the explanation of 10917 here. Well, my accepted program only makes use of a trivial Dijkstra algorithm, followed by a simple O(n^2) count of number of paths. And I can prove that my algorithm always works. I have no idea why one would need to care about DAG or topological sort.

Thanks.

- Observer