Easy# Interpreting a Graph from an Adjacency Matrix

ALGOR-U1LRBR

You are provided with the following **adjacency matrix**:

V | 1 |
2 |
3 |
4 |
5 |
---|---|---|---|---|---|

1 |
0 | 1 | 0 | 0 | 1 |

2 |
0 | 0 | 1 | 0 | 0 |

3 |
0 | 0 | 0 | 0 | 1 |

4 |
1 | 0 | 0 | 0 | 0 |

5 |
0 | 1 | 1 | 0 | 0 |

This matrix represents a **directed graph** with **5** vertices. Each row of the table indicates the outgoing edges from one of the vertices. For example, the first row shows that vertex **1** has outgoing edges to vertices **2** and **5**.

Which of the following graphs is defined by this matrix?