search

Kemsekov / GraphSharp

GraphSharp is a tool to study and use knowledge of graph theory in C#!
MIT License
37 stars 5 forks source link

Add FIndLongestPath algorithm #56

Closed Kemsekov closed 6 months ago

Kemsekov commented 1 year ago

It works the same way as dijkstra algrotihm but you just change sign < to >

Kemsekov commented 1 year ago

Okey, it is turned out to be NP-complete problem.

It is not so easy to solve.

There is a good algorithm that works for directed acyclic graph but it is not general case solution... I will delay this issue a bit and close other ones first.

Kemsekov commented 6 months ago

Actually, it's the same problem as Hamilton path, so there is no reason to keep 2 same issues