Large-Scale Graph Layout

Get complete example

Example: Visualizing a Small Network

GraphPlot[DesarguesGraph]		GraphPlot3D[DesarguesGraph]
2D		3D

Get complete example

Example: Automatic Layout of a Sequence of Networks

GraphPlot automatically finds layouts to represent any form of relational data.

Table[i->Mod[i^2,n], {i, n}] defines a mapping; GraphPlot finds a visual representation for any n.

n = 100 through 130

Example: How GraphPlot Works

This animation shows an example of one method GraphPlot uses to optimize graph layout.

At first the nodes of a graph are arranged randomly. The animation then shows progressive rearrangement with a physics-based algorithm in which nodes interact through idealized spring-like forces. GraphPlot gives the final result automatically, always picking the appropriate algorithm to use.

Example: Using Imported Data for Large-Scale Graph Drawing

This graph, which has 22,044 vertices and 478,668 edges, originated from a finite element structural analysis of the Beijing Botanical Garden Conservatory. The drawing was calculated automatically from a sparse matrix with Mathematica in under a minute.