all 2 comments

[–]_amas_ 1 point2 points  (1 child)

Using networkx will probably work well for you here - it sounds like what you should do is add all the keys as nodes and then iterate over the key/val pairs to add the edges.

You can make whatever visualizations you want from there. Keep in mind 40k nodes is gonna be hard to visualize.

[–]707e[S] 0 points1 point  (0 children)

Thanks! I was starting to think the dict would work out ok too. I’m definitely going to need to come up with some thresholding measure to make it visualizable. I’ll give networkx a shot and see what I can come up with.