Place each vertex in an enclosing circle centered at its parent vertex:

"BalloonEmbedding" works best for tree graphs:

Use the option "EvenAngle"->True to place vertices evenly in an enclosing circle:

With the setting "OptimalOrder"->True, the vertex ordering optimizes the angular resolution and the aspect ratio:

Use the option "RootVertex"->v to set the root vertex:

Use the option "Rotation"->r to rotate the layout:

Use "SectorAngles"->s to control the size of each sector:

The balloon layout works with arbitrary graphs:

Place vertices on two vertical lines based on a bipartite partition:

"BipartiteEmbedding" works for bipartite graphs only:

Place vertices on a circle:

"CircularEmbedding" works best for circulant graphs, LCF notation embeddings and cycle graphs:

Use the option "Offset"->offset to specify the offset angles:

With the setting "OptimalOrder"->True, vertices are reordered so that they lie nicely on a circle:

Place vertices on polygon lines based on a vertex partition:

"CircularMultipartiteEmbedding" works best for k-partite graphs:

Use "VertexPartition"->partition to specify a partition of vertices:

Place vertices on a discrete spiral:

"DiscreteSpiralEmbedding" works best for path graphs:

With the setting "OptimalOrder"->True, vertices are reordered so that they lie nicely on a discrete spiral:

Place vertices so that they minimize mechanical, electrical and gravitational energy when each vertex has a charge and a mass, and each edge corresponds to a spring:

Use the option "RootVertex"->v to set the root vertex:

Place vertices on a grid:

"GridEmbedding" works best for grid graphs:

Use "Dimension"->dim to specify a dimension of a grid:

Place vertices in high dimension according to spring-electrical embedding and project down:

"HighDimensionalEmbedding" works best for large graphs:

Use "RandomSeed"->int to specify a seed for the random number generator that computes the initial vertex placement:

Place vertices on a Poincaré disk.

"HyperbolicRadialEmbedding" works best for tree graphs:

Use the option "RootVertex"v to set the root vertex:

Use "Rotation"r to rotate the layout:

Place vertices on a Poincaré disk:

"HyperbolicSpringEmbedding" works best tree graphs:

With the setting "EdgeWeighted"True, edge weights are used:

Use the option "EnergyControl"e to specify limitations on the total energy of the system during minimization:

Use "InferentialDistance"d to specify a cutoff distance beyond which the interaction between vertices is assumed to be nonexistent:

Use "MaxIteration"it to specify a maximum number of iterations to be used in attempting to minimize the energy:

Use "RandomSeed"int to specify a seed for the random number generator that computes the initial vertex placement:

Use "StepControl"method to define how step length is modified during energy minimization:

Use "StepLength"r to specify the initial step length used in moving the vertices around:

Use "Tolerance"r to specify the tolerance used in terminating the energy minimization process:

Place vertices in several layers in such a way as to minimize edges between nonadjacent layers:

"LayeredEmbedding" works best for tree graphs:

Use the option "LayerSizeFunction"->func to specify the relative height:

Use the option "RootVertex"->v to set the root vertex:

Use the option "LeafDistance"->d to specify the leaf distance:

Use the option "Orientation"->o to draw a tree with different orientations:

The layered drawing works on arbitrary graphs:

Place vertices in a series of layers:

"LayeredDigraphEmbedding" works best for directed acyclic graphs:

Use the option "RootVertex"->v to set the root vertex:

Use the option "Rotation"r to rotate the layout:

Use the option "Orientation"->o to draw a tree with different orientations:

Use the option "VertexLayerPosition"->positions to specify the positions of layers:

The layered digraph drawing works on arbitrary graphs:

Place vertices on a line:

Use the option Method->m to specify the algorithm:

Place vertices on multiple line grids based on a vertex partition:

"MultipartiteEmbedding" works best for k-partite graphs:

Use "VertexPartition"->partition to specify a partition of vertices:

Place vertices on a plane without an edge crossing:

"PlanarEmbedding" works for planar graphs only:

Place vertices in concentric circles:

"RadialEmbedding" works best for tree graphs:

Use the option "RootVertex"->v to set the root vertex:

Use the option "Rotation"r to rotate the layout:

The radial drawing works on arbitrary graphs:

Place vertices randomly:

Place vertices so the weighted sum of squares of mutual distances is minimized:

"SpectralEmbedding" works best for well-structured graphs:

Use the option "RelaxationFactor"->r to get the layout based on a relaxed Laplace matrix:

Place vertices on a sphere:

"SphericalEmbedding" works best for regular structured graphs:

Place vertices on a spiral:

"SpiralEmbedding" works best for path graphs:

With the setting "OptimalOrder"->True, vertices are reordered so that they lie on the spiral nicely:

Place vertices so that they minimize mechanical and electrical energy when each vertex has a charge and each edge corresponds to a spring:

"SpringElectricalEmbedding" works best for most graphs:

With the setting "EdgeWeighted"->True, edge weights are used:

Use the option "EnergyControl"->e to specify limitations on the total energy of the system during minimization:

Use "InferentialDistance"->d to specify a cutoff distance beyond which the interaction between vertices is assumed to be nonexistent:

Use "MaxIteration"->it to specify a maximum number of iterations to be used in attempting to minimize the energy:

Use "Multilevel"->method to specify a method used during a recursive procedure of coarsening a graph:

With the setting "Octree"->True, an octree data structure (in three dimensions) or a quadtree data structure (in two dimensions) is used in the calculation of repulsive force:

Use "RandomSeed"->int to specify a seed for the random number generator that computes the initial vertex placement:

Use "RepulsiveForcePower"->r to control how fast the repulsive force decays over distance:

Use the option "Rotation"r to rotate the layout:

Use "SpringConstant"r to control the constant in the attractive force:

Use "StepControl"->method to define how step length is modified during energy minimization:

Use "StepLength"->r to specify the initial step length used in moving the vertices around:

Use "Tolerance"->r to specify the tolerance used in terminating the energy minimization process:

Place vertices so that they minimize mechanical energy when each edge corresponds to a spring:

"SpringEmbedding" works best for regular structured graphs:

With the setting "EdgeWeighted"->True, edge weights are used:

Use the option "EnergyControl"->e to specify limitations on the total energy of the system during minimization:

Use "InferentialDistance"->d to specify a cutoff distance beyond which the interaction between vertices is assumed to be nonexistent:

Use "MaxIteration"->it to specify a maximum number of iterations to be used in attempting to minimize the energy:

Use "Multilevel"->method to specify a method used during a recursive procedure of coarsening a graph:

Use "RandomSeed"->int to specify a seed for the random number generator that computes the initial vertex placement:

Use the option "Rotation"r to rotate the layout:

Use "StepControl"->method to define how step length is modified during energy minimization:

Use "StepLength"->r to specify the initial step length used in moving the vertices around:

Use "Tolerance"->r to specify the tolerance used in terminating the energy minimization process:

Place vertices on a star shape:

"StarEmbedding" works best for star-like graphs:

Use the option "Offset"->offset to specify the offset angles:

Use the option "Center"->center to specify the center:

Place vertices in a series of layers symmetrically:

"SymmetricLayeredEmbedding" works best for symmetric directed acyclic graphs:

Use the option "Rotation"r to rotate the layout:

The layered digraph drawing works on arbitrary graphs:

Place vertices without crossing edges and minimize the sum of distances to neighbors:

"TutteEmbedding" works for 3-connected planar graphs only:

Print the elided form of a graph:

Useful for large graphs:

Divide edges into segments bundle:

Bundle edges following a hierarchical tree structure:

Straight lines between edges:

Approximate closest packing from the top left:

Approximate closest packing from the center:

Arrange in layers starting at the top left:

Arrange in layers starting at the left:

Arrange in layers starting at the top:

Arrange on a nested grid:

Place vertices on the top of edges:

Place edges on the top of vertices:

Place vertices and edges by the specified order: