From: Larry Evans (jcampbell3_at_[hidden])
Date: 2003-05-30 06:19:46
Jeffrey Hsu wrote:
> Is there any interest in a generic implementation of the
> Lengauer-Tarjan algorithm to compute the immediate dominator
> tree of a flow graph in almost-linear time?
I'd be interested; however, I've no immediate use. I'm only
interested because I'm interested in compilers and analyzing
programs. I also think it would be interesting to see how
you might adapt the boost graph library to do this. The
spirit library could be used for a toy fortran or c like language
to demo the algorithm.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk