dummy-link

NetworkLayout

Layout algorithms for graphs and trees in pure Julia.

Readme

NetworkLayout.jl

Layout algorithms for graphs and trees in pure Julia.

Stable Dev Build Status Coverage

Installation

pkg> add NetworkLayout.jl

Algorithms

The 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](https://github.com/JuliaGeometry/GeometryBasics.jl) `` using NetworkLayout using LightGraphs

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 `LightGraphs.jl` graphs directly.

First Commit

07/25/2016

Last Touched

26 days ago

Commits

142 commits

Requires: