I'm looking for an algorithm to find the longest path between two nodes in a bidirectional, unweighted, cyclic graph.
The path must not have repeated vertices (otherwise the path would be infinite of course).
Would someone point me a to a good one (site or explain)?
The graph will be sparse.
Thanks for any help!