This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
Normally you would be searching for the shortest path from A to B. At least this is what navigation systems do. But here we want to look at the opposite problem: What is the longest possible path to get from A to B? Wikipedia The longest path problem is the problem of finding a simple path of maximum length in a given graph. In contrast to the shortest path problem, which can be solved in…
Normally you would be searching for the shortest path from A to B. At least this is what navigation systems
do. But here we want to look at the opposite problem:
What is the longest possible path to get from A to B?
The longest path problem is the problem of finding a simple path of maximum length in a given graph.
In contrast to the shortest path problem, which can be solved in polynomial time in graphs without
negative-weight cycles, the longest path problem is NP-hard.
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.