Question

Question 2 (1 point) Saved Select all the following that are true: We can apply BFS algorithm to the graph represented by the adjacency matrix $\begin{bmatrix} 0 & 1 & 2 & 2 \\ 1 & 0 & 2 & 4 \\ 2 & 2 & 0 & 2 \\ 2 & 4 & 2 & 0 \end{bmatrix}$ to construct a tree. We can apply the Kruskal's algorithm to the graph represented by the $\begin{bmatrix} 0 & 1 & 2 & 2 \\ 1 & 0 & 2 & 4 \\ 2 & 2 & 0 & 2 \\ 2 & 4 & 2 & 0 \end{bmatrix}$ adjacency matrix to determine the maximum spanning tree We can apply DFS algorithm to the graph represented by the adjacency matrix $\begin{bmatrix} 0 & 1 & 2 & 2 \\ 1 & 0 & 2 & 4 \\ 2 & 2 & 0 & 2 \\ 2 & 4 & 2 & 0 \end{bmatrix}$ to construct a tree. We can apply Prim's algorithm to the graph represented by the adjacency matrix $\begin{bmatrix} 0 & 1 & 2 & 2 \\ 1 & 0 & 2 & 4 \\ 2 & 2 & 0 & 2 \\ 2 & 4 & 2 & 0 \end{bmatrix}$ to determine the minimum spanning tree.

          Question 2 (1 point) Saved
Select all the following that are true:
We can apply BFS algorithm to the graph represented by the adjacency matrix
$\begin{bmatrix} 0 & 1 & 2 & 2 \\ 1 & 0 & 2 & 4 \\ 2 & 2 & 0 & 2 \\ 2 & 4 & 2 & 0 \end{bmatrix}$ to construct a tree.
We can apply the Kruskal's algorithm to the graph represented by the
$\begin{bmatrix} 0 & 1 & 2 & 2 \\ 1 & 0 & 2 & 4 \\ 2 & 2 & 0 & 2 \\ 2 & 4 & 2 & 0 \end{bmatrix}$ adjacency matrix to determine the maximum spanning tree
We can apply DFS algorithm to the graph represented by the adjacency matrix
$\begin{bmatrix} 0 & 1 & 2 & 2 \\ 1 & 0 & 2 & 4 \\ 2 & 2 & 0 & 2 \\ 2 & 4 & 2 & 0 \end{bmatrix}$ to construct a tree.
We can apply Prim's algorithm to the graph represented by the adjacency matrix
$\begin{bmatrix} 0 & 1 & 2 & 2 \\ 1 & 0 & 2 & 4 \\ 2 & 2 & 0 & 2 \\ 2 & 4 & 2 & 0 \end{bmatrix}$ to determine the minimum spanning tree.

Question 2 (1 point) Saved
Select all the following that are true:
We can apply BFS algorithm to the graph represented by the adjacency matrix
< b m a t r i x > to construct a tree.
We can apply the Kruskal's algorithm to the graph represented by the
< b m a t r i x > adjacency matrix to determine the maximum spanning tree
We can apply DFS algorithm to the graph represented by the adjacency matrix
< b m a t r i x > to construct a tree.
We can apply Prim's algorithm to the graph represented by the adjacency matrix
< b m a t r i x > to determine the minimum spanning tree.

Added by Derek G.

Question

Please give Ace some feedback