Problem $1$ Graph Algorithms

$5$ pts$.$

Clearly indicate the following spanning trees in the weighted graph pictured below, assuming that node$-1$ is the start vertex. Some of them have more than one correct answer.

Note: You do not have to demionstrate the algorithm. Just depict the final result

$($a$)$ A breadth$-$first spanning tree, with start node as $1$

$($b$)$ A depth$-$first spanning tree rooted, with start node as $1$

$($c$)$ A shortest$-$path spanning tree, with start node as $1$

$($d$)$ A minimum spanning tree

$($e$)$ A maximum spanning tree

Solution $1$

$($a$)$ Breadth$-$first spanning tree, rooted in $1.$

$($a$)$ Depth$-$frrst spanning tree, rooted in $1.$