# Lengauer Tarjan Algorithm (Dominator Tree)

**URL:** <https://discourse.julialang.org/t/lengauer-tarjan-algorithm-dominator-tree/30593>\
**Category:** Optimization (Mathematical)\
**Created:** [November 1, 2019, 4:02pm UTC](https://discourse.julialang.org/t/lengauer-tarjan-algorithm-dominator-tree/30593 "2019-11-01T16:02:35Z")\
**Posts on this page:** 3\
**Page:** 1

<div class="post-metadata">

**Author:** ![markusb](https://avatars.discourse-cdn.com/v4/letter/m/7cd45c/32.png) [@markusb](https://discourse.julialang.org/u/markusb)\
**Post date:** [November 1, 2019, 4:02pm UTC](https://discourse.julialang.org/t/lengauer-tarjan-algorithm-dominator-tree/30593/1 "2019-11-01T16:02:36Z")

</div>

Dear all,

does anyone know if the Lengauer Tarjan algorithm for creating a domiator tree from a given directed graph (i’m using LightGraphs) is already implemented in a package?

thanks in advance  
Markus

---

<div class="post-metadata">

**Author:** ![Keno](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/keno/32/285_2.png) [@Keno](https://discourse.julialang.org/u/Keno)\
**Post date:** [November 1, 2019, 7:05pm UTC](https://discourse.julialang.org/t/lengauer-tarjan-algorithm-dominator-tree/30593/2 "2019-11-01T19:05:31Z")

</div>

Base has an implementation of SNCA, which is LT with a few bells and whistles that you may be able to adjust for your purposes: [https://github.com/JuliaLang/julia/blob/master/base/compiler/ssair/domtree.jl](https://github.com/JuliaLang/julia/blob/master/base/compiler/ssair/domtree.jl)

---

<div class="post-metadata">

**Author:** ![markusb](https://avatars.discourse-cdn.com/v4/letter/m/7cd45c/32.png) [@markusb](https://discourse.julialang.org/u/markusb)\
**Post date:** [November 3, 2019, 1:50pm UTC](https://discourse.julialang.org/t/lengauer-tarjan-algorithm-dominator-tree/30593/3 "2019-11-03T13:50:03Z")

</div>

Thanks for the hint! I will look at the package