Digraphs Adding Edge Weighted Algorithms

May 09 '23 14:05 RaiyanC

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 some point!

Feb 07 '24 16:02 mtorpey

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 merge. But I'm confident this will broadly make it!

Feb 08 '24 11:02 mtorpey

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
[ ] DigraphMaximumFlow/DigraphMinimumCuts
[ ] RandomUniqueEdgeWeightedDigraph
[ ] DigraphFromPath[s]
[ ] DotColoredEdgeWeightedDigraph

May 22 '24 13:05 mtorpey

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.

Aug 30 '24 14:08 mtorpey