Re: [igraph] Longest path algorithm in igraph?

[Tamás Nepusz]

Is there an algorithm computing longest paths in graphs implemented in
igraph or elsewhere?

Not in igraph, unless the graph is acyclic, in which case you can succeed with negating the edge weights and finding the shortest path. If the graph is directed and acyclic, you may also use the topological sorting algorithm which achieves the same. Otherwise, as far as I know, the problem is NP-hard, and there is no implementation for solving this problem in igraph.

Best,

Tamas