----- Original Message -----
From: "Jeffrey Hsu" <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Friday, May 30, 2003 2:41 AM
Subject: [boost] interest in dominator tree?
> 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'm interested, having recently implemented it myself for the BGL. My only
concern is that the algorithm is very specific to a narrow domain, and might
not belong in Boost. Granted, the thought of a good, _generic_ static
analysis library makes me giggle with glee :)
Doug
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
