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