00:01
We're given a graph, and we're asked to represent this graph with an adjacency matrix.
00:08
We see that the graph has four vertices, so it follows that the adjacency matrix is going to be a four by four matrix.
00:29
And notice also that since all the edges are directed edges, it follows that the graph is a directed graph, and so also there are loops in the graph.
00:41
And so it's possible if there are ones in the diagonal, and it's also possible that the matrix is not symmetric.
00:47
So we'll have to be thorough.
00:51
So first notice the entries of the graph are going to be either 0 or 1 since we don't have multiple edges.
01:06
And it's going to be 0 if the ordered pair, so we have that i guess a i .j is equal to 0.
01:18
If the ordered pair i .j is not an edge, and we have that a i .j is equal to 1...