# Adjacency matrix graph

**Question description**

Construct a graph based on the adjacency matrix that appears below. Label all nodes with indices consistent with the placement of numbers within the matrix. Then, answer the questions that follow.

| 0 3 6 8 5 2 |

| 3 0 4 9 0 0 |

| 6 4 0 4 0 0 |

| 8 9 4 0 2 0 |

| 5 0 0 2 0 0 |

| 2 0 0 0 0 0 |

- How many simple paths are there from vertex 1 to vertex 4?
- Which is the shortest of those paths? How did you determine that?

## Tutor Answer

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors