Algorithm to find the longest path in a directed graph?

Question

Algorithms

Good time of the day, tell me the name of the algorithm that allows you to
Find the longest path in a directed graph, where each edge has a weight.
(not using blunt enumeration)

Answer 1

In an acyclic directed graph, the simplest is DFS.
A recursive function that returns the longest path from a given vertex. Remembering the answer - if we have already launched from this vertex, we return the already calculated result. Otherwise, iterate over all edges from this vertex and take the maximum of dfs from the end of the edge + the length of the edge. We remember this maximum and return the result.

Answer 2

You can start your search here Finding the longest path in a directed acyclic...
Longest path problem