4 ms·
Sounds a lot like the longest path problem [1], which is NP-hard. [1] http://en.wikipedia.org/wiki/Longest_path_problem http://en.wikipedia.org/wiki/Longest_pa
by bananasbandanas 11y ago
Sounds a lot like the longest path problem [1], which is NP-hard.
[1] http://en.wikipedia.org/wiki/Longest_path_problem http://en.wikipedia.org/wiki/Longest_path_problem