Dan Schult

There is no ongoing work on InfoMap that I know of. But @guyroznb should update us if they are still working on it.

I was thinking more simple than the circle and hub layout obtained from an empty graph (which is nice for testing repulsion but not for attraction). I was thinking more...

This is a very constructive set of comments -- thanks @fuglede. I agree that we don't want to duplicate what's already in csgraph. And we want to put wrappers around...

My immediate thought of an algorithm with many adjacency lookups would be the shortest_path or shortest weighted path (dijkstra) routines. But there may be others. The NetworkX Graph structures hold...

Yes, it should be possible to add these features to the structuralhole.py file and corresponding simple tests (just to make sure it runs and works in the simplest of cases).

This duplication stems from a history when we had two `graphviz_layout` functions... one for pydot and one for pygraphviz. This was an attempt to maintain backward compatibility while trying to...

I am +1 for just replacing the existing functions with these naive versions. I haven't looked closely at the function signatures to see how direct this replacement is. But I...

Thanks for the suggestion here. This seems more complex than it first appears. For example, there is no Type Node. Indeed, nodes can be any hashable object. Similarly, there is...

Sorry for poking my head in here again when the discussion is really over in #4014 but I want to ask something related to a comment above. Is there a...

I agree that the current behavior doesn't treat self-loops correctly. But according to #4935 we should not be using either permutations or product. We should be looking at the edges...