8 votes 8 votes Consider the graph shown in the figure below: Which of the following is a valid strong component? $a, c, d$ $a, b, d$ $b, c, d$ $a, b, c$ Graph Theory isro2008 graph-theory graph-connectivity + – go_editor asked Jun 13, 2016 edited Dec 8, 2022 by Lakshman Bhaiya go_editor 4.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 13 votes 13 votes A directed graph is strongly connected if there is a path between all pairs of vertices. So given graph has a b c as a strong component. ManojK answered Jun 13, 2016 selected Jun 13, 2016 by LeenSharma ManojK comment Share Follow See all 2 Comments See all 2 2 Comments reply Amandeep Singh 1 commented Jun 16, 2016 reply Follow Share what is unilaterally graph and give please give on example 0 votes 0 votes ManojK commented Jun 16, 2016 reply Follow Share A digraph is unilaterally connected if for every pair of points there is a path from one to the other (but not necessarily the other way around). 0 votes 0 votes Please log in or register to add a comment.