Skip to content

Tag Archives: Data Structures-Graph

How many undirected graphs (not necessarily connected) can be constructed out of a given set V= {V 1, V 2,…V n} of n vertices ?… Read More
Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r, u) and d(r, v)… Read More
The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity. (A)… Read More
The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be: (A) O(n) (B)… Read More
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the… Read More
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph? (A) In adjacency list representation, space is… Read More

Start Your Coding Journey Now!