in DS
16 views
0 votes
0 votes

Consider the following graph:

Which of the following statements are false?

 

A.There is no cycle in the above graph.

B.There are exactly 3 back edges for a given DFS tree in the graph.

C.There is atleast one strongly connected component present in the graph.

D.The graph has a topological sort.

in DS
by
13 points
16 views

Please log in or register to answer this question.

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.