Question

Problem 2 Strongly Connected Components (SCC) - 30 points Consider the graph below: Run the SCC algorithm on the graph and answer the questions below. When running the algorithm, always break ties alphabetically. (a) (10 points) Write the strongly connected components (SCC) in the order you found them. Your answer should be an ordered list of sets where each set contains the vertices in that SCC b) (10 points) For each SCC listed from part (a), determine which are sink components, which are source components, and which belong to neither category. (c) (10 points) Determine the minimum number of edges that must be added to make the graph strongly connected (i.e. the graph has only one SCC). Justify your answer by providing the edges required There may be multiple correct answers for the edges provided.

          Problem 2
Strongly Connected Components (SCC) - 30 points Consider the graph below:
Run the SCC algorithm on the graph and answer the questions below. When running the algorithm, always break ties alphabetically.
(a) (10 points) Write the strongly connected components (SCC) in the order you found them. Your answer should be an ordered list of sets where each set contains the vertices in that SCC
b) (10 points) For each SCC listed from part (a), determine which are sink components, which are source components, and which belong to neither category.
(c) (10 points) Determine the minimum number of edges that must be added to make the graph strongly connected (i.e. the graph has only one SCC). Justify your answer by providing the edges required There may be multiple correct answers for the edges provided.

problem 2 strongly connected components scc 30 points consider the graph below run the scc algorithm on the graph and answer the questions below when running the algorithm always break ties 90794

Added by John J.

Question

Please give Ace some feedback