detour_problem (333B)
1 # Detour problem 2 3 https://a3nm.net/work/research/questions/#detour-problem 4 5 Given a [directed_graph] and s and t, decide if there is a [simple_path] from s to t which is not a [shortest_path] 6 7 Related work on [induced_paths] in [undirected_graphs]: [berger2021finding] 8 9 [PTIME] algorithm in [chen2026polynomial] 10 11 Up: [shortest_path]