Dan Schult
Dan Schult
The doc_string says this returns an elimination ordering -- not a perfect elimination ordering. From the code it is clear that if the graph is chordal, this function will just...
Great! Thanks for digging through this and for finding the references, etc. So, it seems that we have many functions that could all use this underlying code: - [Edit: `triangulate`...
To avoid the whole DCSR vs CSR, it'd be good to have the adjacency only describe nodes that are connected (and for directed graphs, only the nodes with successors in...
If the goal is to share data, then COO is definitely the way to go. A node table and an edge-list table (with source and target nodes as the lookup...
Thanks for this -- it is the use-case we were wondering about in the discussion of #6563. Can you tell us whether (in your case) you are intentionally using self-loops,...
I merged #4607 with the networkx main branch. Then I updated your branch so this PR is up to date. Adding anything you want to include on this branch should...
I think this is ready to review. It adds 3 helper functions for TSP to use greedy algorithms to get a good start on the problem. Been sitting for a...
It looks like was just plain wrong when I said that the `generate_*` functions returned strings of whole files rather than yielding strings for each part of the file. For...
I think a more natural place for it is in the module `networkx/algorithms/lowest_common_ancestors.py` The tests would then be put in `networkx/algorithms/tests/test_lowest_common_ancestors.py` Thanks!