Skip to main content
. 2013 Jul 29;110(34):13717–13722. doi: 10.1073/pnas.1301111110

Fig. 1.

Fig. 1.

Optimized path configurations on a regular random network. The network comprises 50 nodes (each with Inline graphic) and 10 source–destination pairs. The corresponding costs are Inline graphic (A) and Inline graphic (B). The path of each communication is illustrated by nodes and edges of a specific color, whereas black nodes are shared by more than one path. The size of a node is proportional to the amount of traffic through it, and square nodes represent the source or destination of each communication. Networks are visualized by the NetDraw software (40).