PadhaikoAll subjects

Past exam question: 2065 Shrawan (Regular / Back), Q9

Data Structure and Algorithms · 8 marks

Open in the Padhaiko app

Topic: Graphs

Question

Define directed undirected graph, spanning forest, minimum spanning trees.

Solution

1. Directed and Undirected Graphs:

2. Spanning Forest and Minimum Spanning Tree (MST):

Answer:

A directed graph has ordered one-way edges; an undirected graph has symmetric edges; a spanning forest comprises one spanning tree per connected component; and an MST is a minimum-total-weight spanning tree of a connected weighted graph.

All past exam questions for Data Structure and Algorithms