Reachability
Given a digraph g it is potentially useful to know
- is vertex t reachable from vertex s?
- alternatively, is there a path from s to t?
Could be encapsulated as
bool reachable(Graph g, Vertex s, Vertex t)
|
Example applications:
- can I complete a schedule from the current state?
- is a malloc'd object being referenced by any pointer?
|