JuliaGraphs / JuliaGraphs/Graphs.jl
Feature Request: Dominator Tree
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
It would be nice to have an implementation of the Lengauer-Tarjan algorithm for creating the dominator tree from a given directed graph. Dominator
By looking around for solutions I've found this previous attempt in LightGraphs which somehow hasn't got any attention
https://github.com/sbromberger/LightGraphs.jl/pull/1357
it tries to solve this old issue https://github.com/sbromberger/LightGraphs.jl/issues/1279
an alternativ implementation seems to be in Core.Compiler.DomTree but it seems to be an implementation detail of the compiler, not sure whether it can be reused for Graphs.jl
Contributor guide
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
Start by reviewing the linked LightGraphs pull request #1357 and the older issue #1279 to understand the prior approach. Compare it with Julia's base/compiler/ssair/domtree.jl implementation and determine whether it can be reused. Done means providing a Graphs.jl implementation of the Lengauer-Tarjan dominator-tree algorithm for a directed graph.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 30/100