Given Directed Graph G V E Explain How To Create

Given a directed graph G = (V, E), explain how to create another graph G′ = (V, E′) such that
(a) G′ has the same strongly connected components as G,
(b) G′ has the same component graph as G, and
(c) E′ is as small as possible. Describe a fast algorithm to compute G′.

Posted in Uncategorized