hp.1011's blog

Paths in graphs....
By hp.1011, history, 4 years ago, In English

1) graph G consists of n nodes and m edges 2) G is a directed acyclic graph 3) n<=300 & m<=400 4) Number of simple paths from vertex 1 to vertex n is equal to k.

then what is the maximum value for k for the given constraints.

  • Vote: I like it
  • -27
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it +2 Vote: I do not like it

Lol try to think rather than asking hints for a problem from ongoing Contest.

→ Reply
  • »
    »
    4 years ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    what contest is that?

    → Reply
  • »
    »
    4 years ago, # ^ |
      Vote: I like it -24 Vote: I do not like it

    I don't want to submit the answer and get more rating. I just want to know the answer..

    → Reply
    • »
      »
      »
      4 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Just try to think you will get go the solution. Contest will end after 4 days. You can post a blog after that.

      → Reply