Enhancement: Directed Acyclic Graph Layout

Open
  • Is something wrong?
#20 7 comments 5 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

  • #100 by @BjarkeHautop — closed without merging

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Feature
Clarity
Needs clarification
Activity status
Stale
Tech stack
julia
Domain
data-visualization

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.

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.

Dominant language
Julia
Stars
109
Forks
26
No merged PRs in 30d

Getting set up

This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from JuliaGraphs/NetworkLayout.jl

All issues in JuliaGraphs/NetworkLayout.jl

Similar issues

More Julia issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.