JuliaGraphs / JuliaGraphs/NetworkLayout.jl
Enhancement: Directed Acyclic Graph Layout
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 109
- Forks
- 25
- PR merge metrics
- No merged PRs in 30d
Description
NetworkLayout.jl currently has the Buchheim algorithm for laying out trees. Often data sets are hierarchical, but are not trees. It'd be great to have a layout algorithm for directed acyclic graphs, such as the Sugiyama method or ideally something similar to GraphViz dot.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Read the existing Buchheim tree-layout implementation in NetworkLayout.jl first, then compare the issue's Sugiyama and GraphViz dot references. Define the DAG-layout scope and expected behavior before implementation; done should mean the package provides a documented layout algorithm for directed acyclic graphs rather than only trees.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data-visualization
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100