[prev] 14 [next]

Transitive Closure

Given a digraph G  it is potentially useful to know
  • is vertex t reachable from vertex s?
Example applications:
  • can I complete a schedule from the current state?
  • is a malloc'd object being referenced by any pointer?

How to compute transitive closure?