[DOC] Questions about the internal data structure for DynDiGraph and DynGraph

[adam2392]

Hi,

Great package to extend networkx for a sorely needed functionality of graph representation! I am currently trying to PR the notion of a MixedEdgeGraph into networkx. With that, I am also interested in developing a time-series graph that can contain different types of edges. I am wondering if you can help elaborate on the inner data-structures of the DynGraphs and the "API contract".

1. For example, what is time_to_edge attribute a dictionary comprised of? Are there any constraints?
2. Same for snapshots attribute.
3. How does the edge_removal attribute work? There seems to be no API to remove interactions?

I can help make a PR with inline comments and also documentation to help future users afterwards.

While I'm at it, I also have a question regarding the general API. I noticed that edge and node removals are not supported. Is there any limitations preventing this from being added? If so, is there anything I can do to help?