Update README.md

add dev docs batch

Author: hexaeder

README.md

@@ -2,6 +2,7 @@
 Layout algorithms for graphs and trees in pure Julia.
 
 [![Stable](https://img.shields.io/badge/docs-stable-blue.svg)](https://juliagraphs.org/NetworkLayout.jl/stable)
+[![Dev](https://img.shields.io/badge/docs-dev-blue.svg)](https://juliagraphs.org/NetworkLayout.jl/dev/)
 [![Build Status](https://github.com/JuliaGraphs/NetworkLayout.jl/workflows/CI/badge.svg)](https://github.com/JuliaGraphs/NetworkLayout.jl/actions)
 [![Coverage](https://codecov.io/gh/JuliaGraphs/NetworkLayout.jl/branch/master/graph/badge.svg)](https://codecov.io/gh/JuliaGraphs/NetworkLayout.jl)
 
@@ -13,7 +14,6 @@ pkg> add NetworkLayout.jl
 The available algorithms and their parameters can be found in the
 [docs](https://juliagraphs.org/NetworkLayout.jl/stable).
 
-
 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)
@@ -24,6 +24,12 @@ using LightGraphs
 
 adj_matrix = adjacency_matrix(wheel_graph(10))
 
-algorithm = NetworkLayout.Spring(; iterations=20)
+pos = spring(adj_matrix; iterations=20)
 pos = algorithm(adj_matrix)
 ```
+There is also a "delayed" functor version of each algorithm:
+```julia
+layout = Spring(; iterations=20)
+pos = layout(adj_matrix)
+```
+Instead of passing a adjacency matrix on can also pass `LightGraphs.jl` graphs directly.