Computer Sciences > GATE 2021 SET-2 > Graph Theory

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Consider the following directed graph:

Which of the following is/are correct about the graph?

A

The graph does not have a topological order.

B

A depth-first traversal starting at vertex S classifies three directed edges as back edges.

C

The graph does not have a strongly connected component.

D

For each pair of vertices u and v, there is a directed path from u to v.

Check Answer

Explanation

Correct : a; b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science