00:01
We're given a graph and we're asked to represent this graph with an adjacency matrix.
00:09
Notice that the graph has five vertices, so it follows that the adjacency matrix is a 5x5 matrix.
00:31
And notice also that all edges are directed edges and that loops are allowed, but multiple edges do not seem to be allowed.
00:44
So it follows this is a directed graph, and therefore it's not going to be the case, like it sometimes is with undirected graphs, that the main diagonal, the matrix is going to be all zeros, and it's also not clear if this is going to be a symmetric matrix or not.
01:08
So we're going to have to be careful when calculating.
01:11
So recall that an entry in the matrix is zero if, and say it's entry.
01:26
Ij, aij is 0 if pair ij is not an edge and it's one if the pair ij is an edge.
01:37
So we have that there is no edge from a to a, so this is 0.
01:43
There is an edge from a to b, so this is 1.
01:47
There's no edge from a to c, this is 0.
01:51
There is an edge from a to d, this is 1, and there's no edge from a to e, so this is 0.
01:59
There is an edge from a to b, so this is 1...