Question: A directed graph G = (V, E) is said to be semi connected if, for all pairs of vertices u, v V, we have
A directed graph G = (V, E) is said to be semi connected if, for all pairs of vertices u, v ¬ V, we have u →v or v→ u. Give an efficient algorithm to determine whether or not G is semi connected. Prove that your algorithm is correct, and analyze its running time.
Step by Step Solution
3.48 Rating (161 Votes )
There are 3 Steps involved in it
To determine if G V E is semi connected do the following 1 Call STRONGLYCONNECTEDCOMPONENTS 2 Form the component graph By Exercise 2255 you may assume ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
C-S-A (183).docx
120 KBs Word File
