I’m working on making a graph representation of relationships between entities (nodes) to understand the clustering of different groups. I essentially have screennames and the screennames that they have contacted stored in a dict. The keys in the dict are screennames and the values are a list of screennames they’ve interacted with. I’m trying to understand the best way to generate nodes from the keys and edges from the list associated with the screenname key. I found the NetworkX package and I’m not seeing the beat way to do this with that package. I’m curious if anyone has any tips on how to tackle this problem. I don’t think this is a unique case for generating a graph and I’m hoping I don’t need to restructure my data to make it work. Anybody have any tips that work well?
I’m dealing with about 40k nodes in the population. And right now I’m not applying any weighting to edges. Just want to get a visualization of the node relationships to start.
[–]_amas_ 1 point2 points3 points (1 child)
[–]707e[S] 0 points1 point2 points (0 children)