|
|
Boost : |
From: Jeffrey Hsu (hsu_at_[hidden])
Date: 2003-05-30 04:41:11
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?
Jeffrey
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk