|Graph Algorithm email@example.com (1995-01-30)|
|Date:||Mon, 30 Jan 1995 23:39:13 GMT|
I am looking for an algorithm that will allow me to generate
a difference of 2 flow graphs. In other words, to compute the
set of arcs and nodes that would need to be deleted/added to
transform one flow graph into another. Any pointers to possibly
useful information would be appreciated.
Kevin B. Smith
Return to the
Search the comp.compilers archives again.