History of Network Topology

Hi, I need to store the history of network topology,
for example at time T1, the topology looks like
A->B->C
time T2 it may change to
A->C->B

BTW, and we have ~100K nodes and millions of links, every time we do a building the topology, some of the links may changed, but most of the links are NOT going to change.

So what’s the best practice for this scenario? or is this appropriate to use dgraph?

Thanks
Shihui Yu

If you share samples of what you’re actually doing, would be good.

I had share an idea about intermediate queueing. That might work for you too.

Context:
https://www.reddit.com/r/dgraph/comments/dy72j4/storing_edges_current_and_past/

Samples: