title: Is there an algorithm to "simplify" a dependency graph?
body: <p>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 <code>-&gt;</code> means depends):</p>
  
  <blockquote>
    <p>A -> B -> C &amp; A -> C</p>
  </blockquote>
  
  <p>to </p>
  
  <pre><code>A -&gt; B -&gt; C 
  </code></pre>