0 votes 0 votes in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connected unilaterally connected strongly connected disconnected shipra tressa asked Dec 14, 2018 shipra tressa 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Unilaterally Connected:- A directed graph is said to be unilaterally connected if for any pair of nodes at least one of the nodes is reachable from the other. Refer :- this. hence, b.) Unilaterally connected is the answer. Shubhanshu answered Dec 15, 2018 Shubhanshu comment Share Follow See all 0 reply Please log in or register to add a comment.