Problem
Run the strongly connected components algorithms on the directed graph given by its edges A->C,A->H,B->A,B->G,C->D,D->F,E->A,E->I,F->J,G->I,H->F,H->G,I->H,J->C.
1. Give the SSCs in order found
2. Which are source and which are sink SSCs?
3. Draw the metagraph with nodes the SSCs found
4. Find minimum number of edges you must add to make this graph strongly connected.