Graphs (Data Structures), ASAP please. Consider an undirected graph defined as f

Question

Graphs (Data Structures), ASAP please.

Consider an undirected graph defined as follows: Set of vertices = {0, 1, 2, 3, 4} and Set of edges = {(0, 1), (0, 2), (0,3), (0, 4), (1,3), (3, 4)} Which of the following CANNOT be an order that the vertices are visited using the breadth-first search starting a vertex 1? a-1,0, 3, 2, 4 b. 1,0, 2, 3,4 c. 1,3, 0,4, 2 d. 1, 0, 3, 2,4 Consider the following directed graph description: Set of vertices = {0,1, 2, 3, 4} and the Set of edges = {(0, 2), (0, 3), (1, 0), (2, 4), (3, 1), (3, 4)}. Vertex 0 is an articulation point in this graph. True False Kruskal's Algorithm will always maintain one tree at every stage of development. True False In an undirected graph, edge (v, w) = edge (w, v). True False A biconnected graph is a connected graph with an articulation point. True False

Explanation / Answer

Answer :

6) C : In BFS, It explores the neighbor nodes first, before moving to the next level neighbors.

7)True : because if we remove Vertex 0 it will leave the graph disconnected.

8) True :

Kruskal's Algorithm is directly based on the generic MST algorithm. It builds the MST in forest. Initially, each vertex is in its own tree in forest. Then, algorithm consider each edge in turn, order by increasing weight. If an edge (u, v) connects two different trees, then (u, v) is added to the set of edges of the MST, and two trees connected by an edge (u, v) are merged into a single tree on the other hand, if an edge (u, v) connects two vertices in the same tree, then edge (u, v) is discarded.

9) True

10) False : A biconnected graph has no articulation points . it remains connected after removing any single vertex.

Thanks

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.