Question: Let F be a DAG with n vertices. (a) How many strongly connected components are there in F? Defend your answer. (b) We choose to

Let F be a DAG with n vertices.

(a) How many strongly connected components are there in F? Defend your answer.

(b) We choose to add a directed edge from every sink of F to every source of F. Let F' be the resulting digraph. What is the number of strongly connected components in F'? Defend your answer.

Step by Step Solution

3.35 Rating (158 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a There are n strongly connected components in F b There are n1 strongly connected components in F EXPLANATION a Each vertex in F is its own strongly connected component ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Accounting Questions!