Dan Schult

How does this compare to #6896? And what about to #7965? Also -- after a quick look: - would this be better placed inside the `astar.py` module? - Can you...

Thanks for this introduction (at least to me) of treelets. The already existing `all_simple_paths` function has a `cutoff` parameter and `source` and `target` parameters. So maybe you don't need a...

It is usually not necessary to merge or rebase the main branch into your branch. That is only needed if the lines of the file you are changing get changed...

Hmmm.... but the `nx.all_simple_paths` function uses a starting node with a single traversal. The `nx.all_simple_paths` function ([docs here](https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_paths.html)) takes as a target either a node or an iterable of targets....

The all_simple_paths(G, a, G, cutoff=3) function does a single traversal from a and yield the paths it finds to any node in the targets iterable (which it turns into a...

Understand completely about the bandwidth problem and we all appreciate this PR. Do you have a pointer to a dataset or a way to get a dataset of a chemical...

Looks like this needs: - using "import or skip" to skip tests when numpy is not available: `np = pytest.importorskip("numpy")` inside each test function/class/module that you want to skip. I...

To speed up the `__getitem__` parts you should replace `G.pred[u]` with `G._pred[u]` and `G[u]` with `G._adj[u]`. That bypasses the read-only `Adjacency` class `G.pred` which is slower than the read-write dict...

I don't think there is any dependence of the steps on where the walk ends. You just use the probabilities for each step... and you stop when that walk hits...

It's actually fairly simple to find with a source and a target -- just don't use any mathematical equations :) Start at the source and pick neighbors randomly the way...