search

TimFinucane / Ainur

Solution for parallel task scheduling problem, inspired by the tale of the Lord of the Rings
Other
5 stars 0 forks source link

Sort DFS children before exploring #79

Closed TimFinucane closed 6 years ago

TimFinucane commented 6 years ago

DFS can be further improved by a simple sorting of the children before choosing which one, which will hone in on the best upper bounds more quickly. Should only be about 5-10 LOC.