Dan Schult

I like Option 3. :} It makes it more clear who makes the decision, and the stages are identified with minimal overlap with the verbs that describe the decisions.

The big thing is to get the language decided for both states and actions. Then the rest is already written and pretty clear. One suggestion is to reduce the number...

This looks like the tree module should house this code. We can/should add "see also" links to it from the center-related code docstrings. But let's give it a new section...

Centrality creates measures of how central each node is. Distance measures are typically trying to find single number measures of networks -- like diameter or center. Centrality tries to find...

The [oeis (sequence encyclopedia) website](https://oeis.org/) has under sequence A000055 (number of trees with n unlabeled nodes) a collection of pdfs by Peter Steinbach, entitled the [Field Guide to Simple Graphs,...

Thanks for thinking of us for this contribution. Let's start with big picture questions/issues. We are quite familiar with decompositions as there are many in this library. But what is...

I was looking at the methods like `children` which are one-liners -- and they are not helper functions. They are methods of the helper class Tree. So, my apologies for...

Sorry to take so long to respond to this: - when creating new nodes, one solution we have used elsewhere is to look for new nodes by starting with `-1`...

Have we determined whether `left` and `right` are always mutually exclusive? Are you planning to try to do that?

Thanks for this contribution! We have a need for iterated deepening depth first search as well. But I've not run into using it as an approach to the astar shortest...