diff options
| author | Carlo Zancanaro <carlo@pc-4w14-0.cs.usyd.edu.au> | 2012-07-10 16:42:48 +1000 |
|---|---|---|
| committer | Carlo Zancanaro <carlo@pc-4w14-0.cs.usyd.edu.au> | 2012-07-10 16:42:48 +1000 |
| commit | 77d26a8f2832791587b19351ee1fde207fdda608 (patch) | |
| tree | fe292987ee905226c3238008861b51661d61ab0a /impl | |
| parent | 18dc8b174995d6d37c6cdfc66cb1ba141729b2ed (diff) | |
Update TODO file.
Diffstat (limited to 'impl')
| -rw-r--r-- | impl/TODO.org | 33 |
1 files changed, 21 insertions, 12 deletions
diff --git a/impl/TODO.org b/impl/TODO.org index a33f685..bb4d349 100644 --- a/impl/TODO.org +++ b/impl/TODO.org @@ -3,7 +3,6 @@ - [ ] Separate classes into files - [ ] Put outer-loop in a class (out of main) - [ ] Give EquationSystem methods for creating assignments/strategies - * TODO Verbosity [2/3] - [X] Wrap output streams [5/5] - [X] strategies @@ -31,28 +30,38 @@ maybe we don't need this would be something like "entering/exiting" everything mildly important - [ ] info - print the initial system we're working with - -* TODO make test [2/4] + print the initial system we're working with +* TODO make test [2/3] - [-] write test cases [1/4] - [X] examples from paper - [ ] best cases - [ ] worst cases - [ ] average cases -- [ ] work out correct outputs for each test case - [X] write a script to run over each test case and return pass/fail - [X] consolidate into makefile as `make test` - * TODO Parametrise EquationSystem for Variable, too [0/1] - [ ] Give EquationSystem a template parameter for Variable - I don't think this is necessary, but Thomas wants it - -* TODO Min-cost flow problem [0/3] -- [ ] Research min-cost flow libraries + I don't think this is necessary, but Thomas wants it. + For now I'm going to hold off on it, though. +* TODO Min-cost flow problem [1/3] +- [X] Research min-cost flow libraries Potentially just use LEMON? It looks pretty decent. + LEMON it is! - [ ] Implement the min-cost flow operator MCF + It takes four construction-time arguments and one run-time argument. + Construction time: + - T (the template constraint matrix) + - A (the multiplicative modification factor) + - b (the additive modification factor) + - c (the bound in the guard) + Run-time: + - d (the abstract value to be operated on) - [ ] Update test cases to include MCF - * TODO Presentation [0/2] - [ ] Simplify "Even Faster" solver for explanation -- [ ] Make slides +- [ ] Make slides [0/5] + - [ ] Even Faster Solver + - [ ] Strategy improvement + - [ ] Example of scaling + - [ ] Explain solution + - [ ] Demonstrate implementation |