Graph layouts arrange shapes according to their connections, treating shapes as nodes and connections as edges.
Different algorithms emphasize flow direction, connectivity, symmetry, or compactness.
Places nodes in successive layers to emphasize the main direction of flow in a directed graph.
The algorithm aims to reduce edge crossings, making it suitable for workflows, dependency diagrams, and other hierarchical structures.
Arranges nodes and routes connections using horizontal and vertical segments.
The algorithm aims to reduce edge crossings, connection bends, and the overall drawing area to improve readability.
Arranges nodes on concentric circles, placing root nodes near the center and their descendants on successive outer circles.
Straight connections highlight relationships between the radial levels.
Places all nodes on a single circle and determines their order to reduce edge crossings.
This arrangement provides a compact overview of connections between nodes.
Uses a force-directed model in which connections act as springs and nodes repel one another.
Balancing these forces spreads nodes across the drawing while keeping connected nodes close together.
Uses attractive and repulsive forces to maintain approximately uniform distances between connected nodes.
The resulting arrangement emphasizes symmetry and helps reveal the graph's underlying structure.