(Quiz week 10, nov 3rd) The condition for running a DFS algorithm on the network defined bellow is by using alfabetical order. Then, by applying Kosaraju-Sharir's algorithm, the alternative that contains the correct trees corresponding to the SCC of the network is:


    1. BA, C, ED.
    2. A, CDE, B.
    3. BA, CED.
    4. AC, DE, B.
    5. None of the above
    Original idea by: Fábio Assunção.

    Comments

    Post a Comment