Dan Schult

Fixed in #5879. Thanks @still-n0thing!

Thanks for this! I haven't checked it, but the code suggests that there may be an issue here. We'll fix it if needed. Meanwhile: I would suggest `H = G.to_undirected()`...

This question is even more complicated than described above. The resulting behavior depends on the value of the keys for the edges in the original MultiDiGraph. And IMO it **should**...

I believe the problem here is that your edge weights are 0. If you change them to weight 0.01 you don't get any cycles. I haven't gone through this code...

Can you supply us with a good reference for what you are talking about? Thanks.

But how is the truss number defined? We have a function for the truss subgraph (I guess you know that). There is [a nice article on core and truss](https://link.springer.com/article/10.1007/s41019-018-0068-2) and...

I'm a little confused by all the pep8 stuff. Shouldn't running black once fix all that? Is it true that black doesn't mess with comments and doc_strings but that flake8...

I'm looking at this PR again, and I'm getting more excited about its inclusion. We haven't really made edge and node attributes first class entities in NetworkX. We allow them...

I think the funcs should have reasonable defaults -- like writing all attributes in the ```edge/node_attr_dicts```. Then the ```to_node_dataframe``` output has columns corresponding to the attributes on the nodes. And...

In support of the functions in this PR, here are the one-liners that they replace. **First:** ```to_adjacency_dataarray``` with two adjacencies to stack... : ```python da=xr.concat( [ xr.DataArray(np.expand_dims(nx.adjacency_matrix(G, weight="weight").todense(), axis=-1), dims=["n1","n2","adj_name"],...