/DifferentLengthPathsInGraph

Challenge Problem from Algorithms Professor. Consider the following problem: given an unweighted directed graph G, and nodes s and t, decide whether there exist at least two directed SIMPLE paths from s to t of different lengths. Is the problem solvable in polynomial time, or is it NP-complete?

Primary LanguagePython

Watchers