Michael Young
Michael Young
Some interesting stuff at . Looks complicated-ish.
This might make a good CS/Maths joint SH project.
After discussion in person: - We will leave the 32-bit functionality and tests open for now; - If the 32-bit tests start failing, we'll disable them; - If our 32-bit...
Help output from Drednaut on the command line, for reference: ``` Dreadnaut (Debian 2.6r10+ds-1ubuntu1) version 2.6 (64 bits). > h Modes: An = dense, As = sparse, At = Traces;...
I've rebased this as a single commit and force-pushed to Raiyan's branch. Raiyan, if you want your original commit history it's at https://github.com/mtorpey/Digraphs/tree/edge-weight-algorithms-raiyan-original Hopefully we can get this merged at...
There's a lot of good stuff in here, but I added a couple of TODOs and there's a little work to be done (probably by me) before it's good to...
I'm going to try to merge this one bit at a time, to keep things manageable. Approximate todo list: - [x] EdgeWeightedDigraphMinimumSpanningTree: #650 - [ ] DigraphEdgeWeightedShortestPath[s]: #656 - [...
The latest version of this that I've got is at https://github.com/mtorpey/Digraphs/tree/edge-weight-algorithms As mentioned above, I'm making this into PRs one bit at a time.
@MarkToner will probably be doing this!
This could also be interesting for a joint CS/maths SH project.