Roskind-Tarjan edge-disjoint spanning trees

[dcoudert]

Implement the algorithm proposed in [1] for finding k edge-disjoint spanning trees in a simple graph. If edges are weighted, the sum of the weights of the return trees is minimized.

This will be useful for #32169.

---

[1] J. Roskind and R. E. Tarjan. A note on finding minimum-cost edge-disjoint spanning trees. Mathematics of Operations Research, 10(4):701-708, 1985. https://pubsonline.informs.org/doi/abs/10.1287/moor.10.4.701

CC: @kliem @tscrim @DaveWitteMorris

Component: graph theory

Author: David Coudert

Branch/Commit: 1fd24da

Reviewer: Travis Scrimshaw

Issue created by migration from https://trac.sagemath.org/ticket/32911

[dcoudert]

New commits:

2a8ef60

trac #32911: Roskind-Tarjan edge-disjoint spanning trees

[dcoudert]

Commit: 2a8ef60

[dcoudert]

Description changed:

--- 
+++ 
@@ -4,5 +4,5 @@
 
 ---
 
-[1] J. Roskind and R. E. Tarjan. A note on finding minimum-cost edge-disjoint spanning trees. Mathematics of Operations Research, 10(4):701-708, 1985. 
+[1] J. Roskind and R. E. Tarjan. A note on finding minimum-cost edge-disjoint spanning trees. Mathematics of Operations Research, 10(4):701-708, 1985. https://pubsonline.informs.org/doi/abs/10.1287/moor.10.4.701
 

[dcoudert]

Branch: public/graphs/32911_edsp

[tscrim]

Reviewer: Travis Scrimshaw

[tscrim]

comment:2

Just one trivial doc change:

-      that the weight_function outputs a number for each edge
+      that the ``weight_function`` outputs a number for each edge

Once done, you can set a positive review on my behalf.

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1. New commits:

1fd24da

trac #32911: review commit

[sagetrac-git]

Changed commit from 2a8ef60 to 1fd24da

[dcoudert]

comment:4

Thank you !

[vbraun]

Changed branch from public/graphs/32911_edsp to 1fd24da