YGBoss007's blog

By YGBoss007, history, 3 years ago, In English

Your text to link here... My logic is as follows: First of all, we can get all the SCC's of the graph with their respective sums. Now we can make a condensed graph sort of thing, where each SCC acts as a node. I'm not able to get what to do after that? I gave a hard thought of maintaining DP after that but couldn't get on with the recurrence relations. Any help would be appreciated.

Full text and comments »

  • Vote: I like it
  • +3
  • Vote: I do not like it