Algorithm for appoximating the longest path in the given graph.It implements the greedy algorithm developed by L.L.Pongrácz. It is also tweaked to run in parallel.
-
Notifications
You must be signed in to change notification settings - Fork 0
Algorithm for appoximating the longest path in the given graph. It implements the greedy algorithm developed by L.L.Pongrácz. It is also tweaked to run in parallel.
License
Temurson/LongestPathProblem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithm for appoximating the longest path in the given graph. It implements the greedy algorithm developed by L.L.Pongrácz. It is also tweaked to run in parallel.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published