This allows us to decompose the graph into smaller components in a way that guarantees that an exact solution for each one of the components results in an exact solution for Max-Trans-Graph.
the solution is clearly optimal because we obtain a maximal solution for a less-constrained problem that does not violate any transitivity constraint.