Question: We define a pair of vertices u and v in a directed graph is intimate if u can reach v, or v can reach
We define a pair of vertices u and v in a directed graph is intimate if u can reach v, or v can reach u, or both. 1. Given a directed acyclic graph G (V,E), design an algorithm to decide if every pair of vertices of G is intimate. Your algorithm should run in O(\V|+|E|) time. Prove that your algorithm is correct. 2. Given a directed graph G = (V,E), design an algorithm to decide if every pair of vertices of G is intimate. Your algorithm should run in O(|V|+|E|) time. Prove that your algorithm is correct.
Step by Step Solution
3.47 Rating (147 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
