How can I efficiently plot a graph where each node represents a point in euclidean space?

Question

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 R^3 and each edge represents the di