===Maximum independent (vertex-disjoint) path===Given a directed graph "G" = ("V", "E") and two vertices "s" and "t", we are to find the maximum number of independent paths from "s" to "t".
=== Maximum independent path ===Given a directed graph "G" = ("V", "E") and two vertices "s" and "t", we are to find the maximum number of independent paths from "s" to "t".