Dijkstra Matrix Properties

The assignment content discusses Dijkstra Matrix, a graph representation used in various applications such as GPS, network modeling of infectious disease, and communication processes. It also provides an example of a graph with its corresponding spanning tree, and highlights the properties of the graph matrix, including the use of 1's to represent outgoing vertices and 0's to represent no edges.

Solution 2.
Solution a.
Dijkstra Matrix is used to create the network.
This is used to build the GPS application.
It is used to create the network model of infectious disease in the Biology.
It is used in the communication process so as to find the nearest telecommunication tower.
Solution b.
Consider that G = (V, E). A spanning tree (T) is a tree if it includes all the vertices of G.
And spanning tree is the subset of the graph (G).
Example –
Graph
a
b c
Spanning Tree
a a
b c b c

Solution c.
v = vertices
v A B C D E F G H I J
A 0 1 1 0 1 1 0 1 1 1
B 0 1 1 0 1 0 1 0 0 0
C 0 1 0 1 0 1 1 1 1 0
D 0 0 1 0 1 0 1 0 0 1
E 0 1 1 0 1 1 1 0 1 0
F 0 1 0 0 1 0 0 0 1 1
G 0 0 0 0 0 0 0 0 0 0
H 0 0 0 0 0 0 0 0 0 0
I 0 0 0 0 0 0 0 0 0 0
J 0 0 0 0 0 0 0 0 0 0