list bus rapid transit system (one way):

Please make algorithm in C Code, in order to read bus rapid transit system routes list, please print number of tickets need to buy if people want to visit all places MIN twice, complexity must O(V+E). Where 'V' = number of places, 'E' =number of transits.

NOTE: Apply 'Kosaraju' or 'Tarjan' strongly connected components.

Name Vacation Work 1 Work 2 Work 3 Route A->B->C->D E->B->F->G->H B->N->E H->D->N Name Vacation Work 1 Work 2 Work 3 Route A->B->C->D E->B->F->G->H B->N->E H->D->N