|seeking graph/path expressions algorithms firstname.lastname@example.org (Usha) (2004-03-11)|
|seeking graph/path expressions algorithms email@example.com (1993-11-25)|
|Organization:||Department of Computer Science, University of York, England|
|Date:||Thu, 25 Nov 1993 21:57:30 GMT|
I wonder if anyone out there could point me in the right
direction...I'm seeking an implementation of the single-source
path expression algorithms described by Tarjan (Journal of the
ACM 38(3) July 1981 - "Fast algorithms for solving path problems")
I need such an algorithm to generate relular expressions describing
all the possible flows in a reducible flow graph. Tarjan's paper
clearly states that a "simple" implementation is possible, but if
anyone out there knows of one that already exists, I'd be very
pleased to hear about it!
Thanks in advance,
Return to the
Search the comp.compilers archives again.