Sale!

# Homework #4: Shortest Path Routing

\$30.00

Homework #4: Shortest Path Routing

In this homework, you are asked to write a MATLAB program to find the
distance matrix via the short path routing algorithm in the lecture notes. Please
100×100 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.
 A(i,j)=0, otherwise.
2. Please use matrix A to find the final distance matrix d (Global View).
 d(i,j) is the distance (of the shortest path) from node i to j.

Category:

## Description

Homework #4: Shortest Path Routing

In this homework, you are asked to write a MATLAB program to find the
distance matrix via the short path routing algorithm in the lecture notes. Please
100×100 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.
 A(i,j)=0, otherwise.
2. Please use matrix A to find the final distance matrix d (Global View).
 d(i,j) is the distance (of the shortest path) from node i to j.