You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
All of the algorithms follow the [layout interface](@ref). Each layout algorithm
22
+
All of the algorithms follow the [Layout Interface](@ref). Each layout algorithm
23
23
is represented by a type `Algorithm <: AbstractLayout`. The parameters of each
24
24
algorithm can be set with keyword arguments. The `Algorithm` object itself is
25
25
callable and transforms the adjacency matrix and returns a list of `Point{N,T}` from [`GeometryBasics.jl`](https://github.com/JuliaGeometry/GeometryBasics.jl).
@@ -39,9 +39,20 @@ using NetworkLayout: SFDP
39
39
g = wheel_graph(10)
40
40
layout = SFDP(tol=0.01, C=0.2, K=1)
41
41
f, ax, p = graphplot(g, layout=layout)
42
-
hidedecorations!(ax); hidespines!(ax); ax.aspect = DataAspect(); f #hide
42
+
hidedecorations!(ax); hidespines!(ax); ax.aspect = DataAspect(); f
0 commit comments