Dan Schult

Could we create an issue that tracks the different suggestions for refactoring? If/when that issue gets too long or disjoint, we could convert it into a NXEP with a file...

I thought the idea was to include as much of the Ruff changes into one PR so we don't have too much trouble tracking the "blame" and we don't have...

It is of course true that two linear algorithms can have an arbitrary ratio between the speed up’s. That’s both the joy and trouble with looking too hard at complexity....

The code for `bfs_f` looks like it is subtracting `seen` twice to obtain `level`. If you remove one of them does it make `bfs_f` competitive with `bfs_e` for the upper...

Hmmm.... this algorithm looks more complicated than I expected it would... :} But maybe I was being naive. I'll think about it some more. Meanwhile, can you: - add blank...

I don't think another algorithm is needed... just a simplification of this implementation. For example, using NetworkX functions `nx.ancestors` should eliminate much of the queue creation and modification. And the...

I am creating the migration guide for SciPy on how to convert code that uses sparse matrices to code that uses sparse arrays (or that uses either if you want...

Did you try `pip install pygraphviz`? That way you don’t have to build the wheel.

What is the code you are using and with what inputs. I don’t understand the output. It says at the top there is a syntax error at a line you...

Thanks, that helps. I created a dot file with a single edge and two nodes with the name from the example. I was able to run the example code without...