Repository navigation
v3.0.0
Complete rewrite of exact algorithm
- Now assignment problem is solved fully using full hungarian method, instead of part of it
- Use BFS (Best First Search) instead of DFS when branching (as long as it doesn't take too much RAM)
- Multithreading
Also: now solutions with repeat connections don't include same solution twice. Previously 1,2,3,(2),4 was considered different from 1,(2),3,2,4. Note that if you were to manually input those connections you would get those "duplicates" aswell, so it's better to not input repeat connections manually to not dilute the solution pool.