Alex Rivera | Logout

Is there an algorithm to "simplify" a dependency graph?

Asked 2012-05-16T13:00:20.807
9

My problem is very simple but I don't really know its name and therefore, it's hard to find a solution by myself : How to simplify a dependency graph like (where -> means depends):

A -> B -> C & A -> C

to 

A -> B -> C
graph-algorithm simplify
Edit
Report

1 Answer

8

You are looking for transitive reduction.

For a discussion of algorithms, see Transitive Closure and Reduction.

answered 2012-05-16T13:18:36.610

Your Answer