Dan Schult

I merged with main again to pull in some recent fixes in main. Still some failures apparently unrelated to this PR. @math-hiyoko I just wanted to warn you that you...

Other issues from the two recent PRs to discuss: (thanks @Peiffap!) - Do we want the tree namespace to be separate from the main namespace? We now have two functions...

The cited paper/book for `chordal_cycle_graph` has the cited theorem 4.4.2 which says that connecting as we do in the function creates cubic graphs. (cubic graphs just means it is 3-regular)....

What takes a long time for computing the length of a path? It should be fairly quick computationally. And NetworkX has a function to do it: [nx.path_weight](https://networkx.org/documentation/stable//reference/generated/networkx.classes.function.path_weight.html#networkx.classes.function.path_weight) What aspect of...

Thanks for your rewording of the OP. I now understand that this aims to allow folks to avoid creating the paths in the Djikstra part of the Johnson method. As...

I'm thinking we would raise on this case. More generally, I would think always returning `dist` and then updating the provided dicts for `paths` and/or `pred` is clear and useful....

I'm pretty sure the superLU solver returns a dense vector because that's what we should expect -- most often, solving a sparse system will give a dense result. As for...

This sounds like it would be really long -- I mean it doesn't take much to blow up the number of possible trails. And recursive approaches can run into memory...

Interesting -- and seems like a good fit to go in the `steinertree.py` module. This API has a root node which the `steiner_tree()` function does not. How would this root...

We need to test equality when we are doing isomorphism checks. The `