LayeredLayouts

Layered Layout Algorithms for Directed Acyclic Graphs

https://github.com/oxinabox/layeredlayouts.jl

Science Score: 54.0%

This score indicates how likely this project is to be science-related based on various indicators:

✓
CITATION.cff file
Found CITATION.cff file
✓
codemeta.json file
Found codemeta.json file
○
.zenodo.json file
✓
DOI references
Found 1 DOI reference(s) in README
○
Academic publication links
✓
Committers with academic emails
1 of 10 committers (10.0%) from academic institutions
○
Institutional organization owner
○
JOSS paper metadata
○
Scientific vocabulary similarity
Low similarity (8.0%) to scientific vocabulary

Keywords from Contributors

graphics

Last synced: 7 months ago · JSON representation ·

Repository

Layered Layout Algorithms for Directed Acyclic Graphs

Basic Info

Host: GitHub
Owner: oxinabox
License: mit
Language: Julia
Default Branch: main
Size: 2.3 MB

Statistics

Stars: 38
Watchers: 3
Forks: 10
Open Issues: 7
Releases: 9

Created almost 6 years ago · Last pushed almost 2 years ago

Metadata Files

Readme License Citation

LayeredLayouts

LayeredLayouts is a package for working out how to layout graphs in a layered fashion. In particular for how to layout directed acyclic graphs (DAGs), including trees, dependency graphs, and sankey diagrams. It is not a package for actually visualizing graphs, rather it is a suitable helper for those to use. It is a lot like NetworkLayout.jl.

Presently it has one algorithm: Zarate, based on D. C. Zarate, P. L. Bodic, T. Dwyer, G. Gange and P. Stuckey, "Optimal Sankey Diagrams Via Integer Programming," 2018 IEEE Pacific Visualization Symposium (PacificVis), Kobe, 2018, pp. 135-139, doi: 10.1109/PacificVis.2018.00025.. Which is a Sugiyama style layout algorthm via full mixed integer programming.

Starting from v0.2 LayeredLayouts.jl switches from LightGraphs.jl to Graphs.jl for graph representation. See this discourse post for more information. If you want to use LightGraphs.jl please specifically ] add LayeredLayouts@0.1

Usage

```julia julia> using LayeredLayouts, Graphs

julia> tiny_depgraph = SimpleDiGraph(Edge.([ 1 => 2; 2 .=> [4, 5, 6]; 3 .=> [2, 4, 5, 6, 7, 8]; 4 .=> [9, 10, 11]; ])) {11, 13} directed simple Int64 graph

julia> xs, ys, paths = solvepositions(Zarate(), tinydepgraph);

julia> xs, ys ([1.0, 2.0, 1.0, 3.0, 3.0, 3.0, 2.0, 2.0, 4.0, 4.0, 4.0], [-0.500000683006983, -0.9285709647225431, 0.500000681452564, 0.40476260792712027, -0.5952375840605986, -1.5952379163280372, 3.0714291353124143, 2.0714290900138614, 1.404762745121713, 0.4047626078228009, -0.5952375294761111])

julia> paths Dict{Graphs.SimpleGraphs.SimpleEdge{Int64},Tuple{Array{Float64,1},Array{Float64,1}}} with 13 entries: Edge 2 => 5 => ([2.0, 3.0], [-0.928571, -0.595238]) Edge 3 => 8 => ([1.0, 2.0], [0.500001, 2.07143]) Edge 3 => 5 => ([1.0, 2.0, 3.0], [0.500001, 0.0714291, -0.595238]) Edge 4 => 11 => ([3.0, 4.0], [0.404763, -0.595238]) Edge 3 => 2 => ([1.0, 2.0], [0.500001, -0.928571]) Edge 4 => 10 => ([3.0, 4.0], [0.404763, 0.404763]) Edge 3 => 4 => ([1.0, 2.0, 3.0], [0.500001, 1.07143, 0.404763]) Edge 3 => 7 => ([1.0, 2.0], [0.500001, 3.07143]) Edge 2 => 4 => ([2.0, 3.0], [-0.928571, 0.404763]) Edge 1 => 2 => ([1.0, 2.0], [-0.500001, -0.928571]) Edge 2 => 6 => ([2.0, 3.0], [-0.928571, -1.59524]) Edge 3 => 6 => ([1.0, 2.0, 3.0], [0.500001, -1.92857, -1.59524]) Edge 4 => 9 => ([3.0, 4.0], [0.404763, 1.40476]) ```

Gallery

This plots are from the examples in test/examples.jl, plotted via script in test/demos.jl.

As you can see in the first plot below, pathing though the dummy nodes actually guarantees minimal number of crossings. On the tinydepgaph_ example direct has 3 crossings, where as path through dummy node only 2). However, it also doesn't actually always look as nice. It might look nicer if you used some swishy Bezier curves though (Plots.jl has a curves attribute, and a matching function, which does this) We leave that to the visualization library.

Owner

Name: Frames White
Login: oxinabox
Kind: user
Location: Perth, Australia
Company: @JuliaComputing

Website: https://www.oxinabox.net/
Twitter: oxinabox_frames
Repositories: 262
Profile: https://github.com/oxinabox

Writing software for math, by math. 🏳️‍⚧️

Citation (CITATION.bib)

@misc{LayeredLayouts.jl,
	author  = {Frames White <me@oxinabox.net> and contributors},
	title   = {LayeredLayouts.jl},
	url     = {https://github.com/oxinabox/LayeredLayouts.jl},
	version = {v0.1.0},
	year    = {2020},
	month   = {6}
}

GitHub Events

Total

Issues event: 2
Watch event: 2
Issue comment event: 4
Fork event: 1

Last Year

Issues event: 2
Watch event: 2
Issue comment event: 4
Fork event: 1

Committers

Last synced: almost 2 years ago

All Time

Total Commits: 121
Total Committers: 10
Avg Commits per committer: 12.1
Development Distribution Score (DDS): 0.694

Past Year

Commits: 12
Committers: 3
Avg Commits per committer: 4.0
Development Distribution Score (DDS): 0.5

Top Committers

Name	Email	Commits
davide-f	f**s@g**m	37
Lyndon White	l**e@i**k	33
Lyndon White	o**x@u**u	20
Thomas Christensen	t**r@m**u	13
Gauthier Soleilhac	g**c@g**m	5
Steve Kelly	k**a@g**m	4
Hans Würfel	g**t@w**o	4
pszufe	p**e@g**m	3
Dilum Aluthge	d**m@a**m	1
Frames White	me@o****t	1

Committer Domains (Top 20 + Academic)

oxinabox.net: 1 aluthge.com: 1 wuerfel.io: 1 mit.edu: 1 ucc.asn.au: 1 invenialabs.co.uk: 1

Issues and Pull Requests

Last synced: 7 months ago

All Time

Total issues: 20
Total pull requests: 25
Average time to close issues: 8 months
Average time to close pull requests: about 2 months
Total issue authors: 11
Total pull request authors: 9
Average comments per issue: 3.65
Average comments per pull request: 3.52
Merged pull requests: 20
Bot issues: 0
Bot pull requests: 0

Past Year

Issues: 2
Pull requests: 0
Average time to close issues: N/A
Average time to close pull requests: N/A
Issue authors: 2
Pull request authors: 0
Average comments per issue: 1.0
Average comments per pull request: 0
Merged pull requests: 0
Bot issues: 0
Bot pull requests: 0

View more stats

Top Authors

Issue Authors

oxinabox (5)
davide-f (5)
thchr (2)
atiyabzafar (1)
asinghvi17 (1)
Roh-codeur (1)
gsoleilhac (1)
cormullion (1)
JuliaTagBot (1)
davibarreira (1)
pszufe (1)

Pull Request Authors

oxinabox (8)
davide-f (7)
thchr (4)
filchristou (1)
DilumAluthge (1)
gsoleilhac (1)
hexaeder (1)
pszufe (1)

Top Labels

Issue Labels

help wanted (2) good first issue (2) enhancement (2)

Pull Request Labels

Packages

Total packages: 1
Total downloads:
- julia 29 total

Total dependent packages: 6
Total dependent repositories: 0
Total versions: 14

juliahub.com: LayeredLayouts

Layered Layout Algorithms for Directed Acyclic Graphs

Documentation: https://docs.juliahub.com/General/LayeredLayouts/stable/
License: MIT
Latest release: 0.2.10
published almost 2 years ago

Versions: 14
Dependent Packages: 6
Dependent Repositories: 0
Downloads: 29 Total

Rankings

Dependent repos count: 9.9%

Dependent packages count: 13.2%

Average: 15.2%

Stargazers count: 18.3%

Forks count: 19.4%

Last synced: 7 months ago

Dependencies

.github/workflows/TagBot.yml actions

JuliaRegistries/TagBot v1 composite

.github/workflows/ci.yml actions

actions/cache v1 composite
actions/checkout v2 composite
codecov/codecov-action v1 composite
julia-actions/julia-buildpkg v1 composite
julia-actions/julia-processcoverage v1 composite
julia-actions/julia-runtest v1 composite
julia-actions/setup-julia v1 composite

LayeredLayouts

Science Score: 54.0%

Keywords from Contributors

Repository

Basic Info

Statistics

Metadata Files

README.md

LayeredLayouts

Usage

Gallery

Owner

Citation (CITATION.bib)

GitHub Events

Total

Last Year

Committers

All Time

Past Year

Top Committers

Committer Domains (Top 20 + Academic)

Issues and Pull Requests

All Time

Past Year

Top Authors

Issue Authors

Pull Request Authors

Top Labels

Issue Labels

Pull Request Labels

Packages

juliahub.com: LayeredLayouts

Rankings

Dependencies