How can I print the longest path in a graph given the Graph is a unweighted DAG.

Revision en1, by mkitkat, 2020-03-16 09:00:22

Help with the approach and code in C++. Thanks I have tried Dijkstra by make every edge weights to -1. But I am not able to print the longest path.

Tags dag, longest path, print path


  Rev. Lang. By When Δ Comment
en1 English mkitkat 2020-03-16 09:00:22 228 Initial revision (published)