# Graph Algorithm

## kevins@ibeam.intel.com

Mon, 30 Jan 1995 23:39:13 GMT

*From comp.compilers*

| List of all articles for this month |

**Newsgroups: ** | comp.compilers |

**From: ** | kevins@ibeam.intel.com |

**Keywords: ** | theory, question |

**Organization: ** | Compilers Central |

**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

kevins@ibeam.intel.com

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.