Скоро Codeforces Round 1133 (Div. 1, Div. 2)! Регистрация здесь. ×

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

Правка en1, от 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.

Теги dag, longest path, print path

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский mkitkat 2020-03-16 09:00:22 228 Initial revision (published)