Layout algorithms for graphs and trees in pure Julia.
pkg> add NetworkLayoutThe available algorithms and their parameters can be found in the docs.
All of the algorithms represent mappings adjacency matrix ↦ vector of positions where the positions are represented by the Point datatype from
`GeometryBasics.jl
using NetworkLayout
using Graphs
adj_matrix = adjacency_matrix(wheel_graph(10))
pos = spring(adj_matrix; iterations=20)
pos = algorithm(adj_matrix)There is also a "delayed" functor version of each algorithm:
layout = Spring(; iterations=20)
pos = layout(adj_matrix)Instead of passing a adjacency matrix on can also pass Graphs.jl graphs directly.