Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Maximum number of path for simple acyclic directed graph with start and end node

  1. Jan 22, 2013 #1
    Say given a simple acyclic directed graph with n nodes , which includes a starting node s0 and ending node e0 (i.e., a kripke structure without loop)
    what is the maximum number of path from s0 to e0?
     
  2. jcsd
  3. Jan 23, 2013 #2
    The solution could be written in terms of powers of the (nilpotent) adjacency matrix.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook