Sale!

# Homework #3: Spanning Tree Algorithm

\$30.00

Homework #3: Spanning Tree Algorithm

In this homework, you are asked to write a MATLAB program to find the adjacency
matrix of the spanning tree via the spanning tree algorithm in the lecture notes. Please
matrix named “A”) on eLearn.
1. The matrix A is the adjacency matrix of a network with 100 nodes.
 A(i,j)=1, if there is an edge between nodes i and j and 0 otherwise.
2. Node “1” is root.
3. Please use matrix A to find the adjacency matrix t of the spanning tree via the
spanning tree algorithm in the lecture notes.

Category:

## Description

Homework #3: Spanning Tree Algorithm

In this homework, you are asked to write a MATLAB program to find the adjacency
matrix of the spanning tree via the spanning tree algorithm in the lecture notes. Please
matrix named “A”) on eLearn.
1. The matrix A is the adjacency matrix of a network with 100 nodes.
 A(i,j)=1, if there is an edge between nodes i and j and 0 otherwise.
2. Node “1” is root.
3. Please use matrix A to find the adjacency matrix t of the spanning tree via the
spanning tree algorithm in the lecture notes.
 matrix t is the adjacency matrix of the spanning tree and t(i,j)=1 if there is an
edge between nodes i and j in the tree and 0 otherwise.