- #1
jack1234
- 133
- 0
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?
what is the maximum number of path from s0 to e0?