Dan Schult

Yes, this problem occurs in undirected G.edges and other places as well. It is not restricted to strings either. ```G.out_edges((-2, -3, -4))``` returns an empty edge view too if none...

I think the existing API can be used in a more restrictive way to do as you say: - Use G.succ[u] to get edges (actually neighbors, but you can make...

Can you be more specific?

This sounds promising.

I think the boundary between graph learning algorithms and graph algorithms is pretty porous. I think there is a fair region of overlap where algorithms of one can be included...

Good point! -- But it also makes sense to put all the dot stuff in one place. Maybe the dot/pydot/pygraphviz should all be in read/write instead of drawing? At a...

Also relevant to this discussion is the recent PRs for test representations (drawing using unicode/ascii) and for conversion to LaTeX. Which should be in read/write and which should be in...

This question is quite old, and I think a complete answer requires looking at the reference paper to see how they count the number of edits and in particular how...

[We have some measures](https://networkx.github.io/documentation/stable/reference/algorithms/centrality.html) that are not on that list. And some that are. and some I'm not familiar with. Are you able to make a pull request with any...

The "bible" paper listed above reports that in their comparisons an algorithm called InfoMap did best. How about starting with that one?