Dr.-Ing. Helmut Melcher

Then, based on this algorithm: Add example to tutorial: longest path in graph with cycles. Cut condition: only (re-)visit a vertex if a longer path to it has been found