Module layout

Graph layout algorithms for visualization

This module provides algorithms for computing node positions for graph visualization.

Structs

Position

2D position for graph layout

Functions

circular_layout

Compute a circular layout for the graph

hierarchical_layout

Compute a hierarchical layout for a directed acyclic graph

spectral_layout

Compute a spectral layout based on eigenvectors of the Laplacian

spring_layout

Compute a spring layout using force-directed placement