The longest way graphics

Question

How to find the longest path on a chart? I thought I could use a depth search, but I could not find an easier implementation for it?

Answer 1

Like a brainjam , in the comments this is a complete NP. it is only polynomial if the graph is acyclic. if his DAG is even linear. check out wikipage again for more information.

Answer 2

try using topological sorting for a directed graph. it is specifically designed for task planning ...

http://en.wikipedia.org/wiki/Topological_sorting

Answer 3

DAG G = (V, E), .

node s t.

, opt(I)= max(opt(j)+1) j (j, I) E.

opt (s) = 0 -inf s t ( s, t " t).

, DAG (Directed Acyclic Graph).

, DAG, -1, Bellman Ford, (!) , .

Answer 4

/ node 1/( //),