| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Silence debug messages | Franklin Wei | 2018-11-15 |
| | | |||
| * | Refine algorithm termination condition; add pruning | Franklin Wei | 2018-11-15 |
| | | | | | | Now checks for "proper" completion: no paths from s to t except the one direct edge. Also prunes the graph at each step. | ||
| * | Clarify help text | Franklin Wei | 2018-11-13 |
| | | |||
| * | Allow dumping in internal format (for re-examining output) | Franklin Wei | 2018-11-13 |
| | | | | | Pretty cool feature, I think. | ||
| * | Command-line parsing and miscellaneous fixes | Franklin Wei | 2018-11-12 |
| | | |||
| * | Update things | Franklin Wei | 2018-11-12 |
| | | | | | Need to refine termination condition. Apart from that, it's fairly robust. | ||
| * | Change graph description format | Franklin Wei | 2018-11-12 |
| | | | | | Also adds a `genrand' program for testing purposes. | ||
| * | Clean up code; add GPLv2 license | Franklin Wei | 2018-11-12 |
| | | |||
| * | Add delta-Y transform | Franklin Wei | 2018-11-11 |
| | | | | | Now we should be able to simplify any resistor network. | ||
| * | Initial commit | Franklin Wei | 2018-11-11 |
| A mostly functional proof-of-concept | |||