The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+5 votes
1.5k views

Consider the graph shown in the figure below:

Which of the following is a valid strong component?

  1. a, c, d
  2. a, b, d
  3. b, c, d
  4. a, b, c
asked in Graph Theory by Veteran (116k points)
recategorized by | 1.5k views

1 Answer

+12 votes
Best answer

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.

answered by Boss (38.8k points)
selected by
0
what is unilaterally graph and give please give on example
0

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).

Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,425 questions
53,605 answers
185,879 comments
70,883 users