IDorando's blog

By IDorando, history, 20 months ago, In English

Hi Codeforces! There is a problem where it asks you to find the the number of paths between 2 vertices in a directed graph. There are no cycles and you are not allowed to visit the same node multiple times. I have seen some solutions in O(n!) and O(n ^ 2) but I need something more efficient since the number of nodes N is 100000 and the number of edges is 300000. I would really appreciate if you could give me some ideas!

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it