You would be surprised how hard it is to visualize arbitrary graphs. Basically, we can only render small highly regular ones in a neat way. Everything beyond that turns into a ball of wool.
Graphs in general are high dimensional structures and don't lend themselves to 2D projections. That is not a problem with coding the layouting algorithm. There simply is no good geometric arrangement for most graphs / networks because they are not planar [0], or even close to it (with few intersections).