# How can I examine the subnetworks of a nearly fully connected graph?

I have an almost fully connected graph in python with roughly 3k nodes and 9M edges. Each node in this graph is represented by a point in R3 and each edge represents the distance between them with a weight given by a weight matrix.

My goal is to visualize subnetworks (areas where points close to each other also have a dense set of edge weights) where the subnetwork is colored by the given weight. However, this is extremely computationally expensive, as there are 9M edges. I'm looking for an algorithm that can either return the subnetworks, visualize these subnetworks, or something similar.

• stackoverflow.com/q/64321080/781723
– D.W.
Oct 13 '20 at 22:18
• I don't understand the task. What is meant by "colored by the given weight"? What are the inputs to the algorithm? Why can't you just extract the subnetwork, treat that as a new graph, and plot it with any graph visualization tool?
– D.W.
Oct 13 '20 at 22:27
• @D.W. How would I extract the subnetwork? The problem with most graph viz libraries is they don't allow for viz in euclidean space (nodes represent poitns in R^3). The inputs to the algorithm would be a set of weights and a set of vertices - you could think of this as a directed weighted graph, perhaps. How, would I then return a subnetwork of points that fall in a euclidean cluster and have high weights. Oct 14 '20 at 3:03
• @D.W. why did you point to my stackoverflow post with the same question? They were the ones that told me to come here Oct 14 '20 at 3:05
• A useful tag/keyword may be clustering. Oct 23 '20 at 8:44