Question

Consider the following graph,

Let the nodes be stored in memory in an array G as :G; X, Y, Z, W

(i) Find the adjacency matrix A of the graph G. 

(ii) Find the path matrix P of G using powers of the adjacency matrix -A. 

(iii) Is G strongly connected?

Answer 1

Adjacercy Matrix 'A' = 

Path matrix ‘P’ =

(iii) No, G is not strongly connected.