Dan Schult

I think the random number generation in asadpour is fine. But calling `traveling_salesman_problem` doesn’t present a way to provide the seed to the asadpour function directly. One of the tests...

Whoops! Sorry @mjschwenne I stand corrected. The seed is set in the test function. Not sure what I was looking at. :} I have extracted the test function and run...

This looks good... Can you check out the docs (starting at the [bipartitie reference to find_extendability](https://2163-890377-gh.circle-artifacts.com/0/doc/build/html/reference/algorithms/bipartite.html#module-networkx.algorithms.bipartite.extendability)) These are available from the final test "Details" link. The final test is a...

I'm not sure what exactly is causing tis error, but it is certainly not your code. So, the way I would try to solve it is to merge the networkx...

Two minor changes based on the latest update: - can you add a couple of sentences after the paragraph describing what this function does (after the lemma). These should probably...

I find quite a lot of literature using searches: "extendable graph theory" and especially "k-extendable graph theory". So, I think this should be included. I'll try to look for a...

A good canonical article to link to for k-extendable graphs is: `M. D. Plummer. On n-extendible graphs. Discrete Mathematics, 31:201–210, 1980 https://doi.org/10.1016/0012-365X(80)90037-0` As for names, the original article uses `n-extendability`...

You are correct that `neighbors` is a callable function that returns the neighbors of a visited node so they can be added to the queue. And `sort_neighbors` seems to do...

That message has been there for 6 years which makes me think there is a way around the difficulty you are talking about. Though I could be wrong of course....

Be careful with H=nx.DiGraph(G) because that just makes the last edge iterated over in G between (u,v) become the edge in H. So, it is ignoring the multiedge attributes --...