How do find the longest path in a cyclic Graph between two nodes?
Posted
by Nazgulled
on Stack Overflow
See other posts from Stack Overflow
or by Nazgulled
Published on 2010-04-20T22:15:46Z
Indexed on
2010/04/20
22:23 UTC
Read the original article
Hit count: 405
Hi,
I already solved most the questions posted here, all but the longest path one. I've read the Wikipedia article about longest paths and it seems any easy problem if the graph was acyclic, which mine is not.
How do I solve the problem then? Brute force, by checking all possible paths? How do I even begin to do that?
I know it's going to take A LOT on a Graph with ~18000. But I just want to develop it anyway, cause it's required for the project and I'll just test it and show it to the instructor on a smaller scale graph where the execution time is just a second or two.
At least I did all tasks required and I have a running proof of concept that it works but there's no better way on cyclic graphs. But I don't have clue where to start checking all these paths...
© Stack Overflow or respective owner