Computer scienceAlgorithms and data structuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Spanning tree

A spanning tree in unweighted graphs

Report a typo

For a connected unweighted graph $G$ having $n$ nodes, a spanning tree is ...

Select one option from the list

... a subgraph of

G

that connects all nodes of

G

... any subgraph of

G

that is a tree.

... any subgraph of

G

that contains

n-1

edges.

... a subgraph of

G

that is a tree and connects all the nodes of

G

Create a free account to access the full topic