Maximum number of path for simple acyclic directed graph with start and end node
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?