Dan Schult
Dan Schult
#### Reference issue Fixes gh-19943 #### What does this implement/fix? Implement setdiag for compressed format that avoids index value setting by converting to coo format, calling setdiag, and then converting...
Fixes #6848 - Introduce PythonRandomViaNumpyBits to replace PythonRandomInterface. Follows Robert Kern @rkern comment suggestion in numpy/numpy#24458 - rewrite old interface to not raise (and use new interface to get a...
I'm running tests locally on the main branch and get a test failure in `networkx/algorithms/bipartite/operators/tests/test_binary.py::test_intersection`. According to the comments there, that test should only be run "if not performing auto...
This is an issue to try to keep track of ideas in discussions we've had about a data structure for network analysis that could be read directly by other platforms...
I looked at the changes in Python 3.10 to see what we could now use and noticed: - [ ] the `match` statement which is a super-powerful switch/case system. -...
This PR sets up the VF2++ functions to allow easier addition of the subgraph versions of the problem. The main change are to add the degree dicts to the namedtuple...
It would be good to add a function that returns all the lowest common ancestors. There is [a post on Baeldong.com](https://www.baeldung.com/cs/lowest-common-ancestor-acyclic-graph) that describes a fairly simple algorithm to implement this...
### Is your feature request related to a problem? Please describe. A sparse array/matrix `A` with no stored values (all zeros) makes `str(A)` return an empty string `""`. This is...
### Is your feature request related to a problem? Please describe. For a sparse array/matrix `A` the phrase `repr(A)` returns: ``` ``` The shape of the matrix reads nicely as...
This rewrites the copy functionality within nx-loopback to ensure that the neighbor order is the same in the copy. Instead of copying edges, this copies adjacencies (careful to ensure opposite...