A graph G = (V, E) consists of a set V of vertices/nodes and a set E of edges. Which of the following is correct?

Question

A graph  G = (V, E)  consists of a set  V  of vertices/nodes and a set  E  of edges. Which of the following is correct?

Answer

Breadth first search of a graph pushes every newly discovered node into a stack of vertices/nodes to be processed.

Answer

Depth first search of a graph enqueues every newly discovered node into a queue of vertices/nodes to be processed.

Answer

A spanning tree of an undirected connected graph with 9 vertices will contain 10 edges connecting all vertices.

Answer

In a graph, an undirected edge may be represented as an unordered pair of vertices.

Crowdly