• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    迪恩网络公众号

JuliaGraphs/NetworkLayout.jl: Layout algorithms for graphs and trees in pure Jul ...

原作者: [db:作者] 来自: 网络 收藏 邀请

开源软件名称:

JuliaGraphs/NetworkLayout.jl

开源软件地址:

https://github.com/JuliaGraphs/NetworkLayout.jl

开源编程语言:

Julia 100.0%

开源软件介绍:

NetworkLayout.jl

Layout algorithms for graphs and trees in pure Julia.

Stable Dev Build Status Coverage

Installation

pkg> add NetworkLayout

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

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.




鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap