READ_ONLY_ACCESS
[
  {
    "id": "ct-w08-000",
    "front": "Week 8 Diagnostic: In an edge-weighted graph, what does entry A[i][j] in the adjacency matrix store when an edge exists between vertex i and j?",
    "back": "Answer: A — In a weighted graph, non-zero matrix entries represent the corresponding edge weights."
  },
  {
    "id": "ct-w08-001",
    "front": "Week 8 Diagnostic: If vertex 1 has outgoing directed edges to vertices 2 and 4, how many non-zero entries exist in row 1 of the directed adjacency matrix?",
    "back": "Answer: 2 — Row 1 encodes the outgoing edges from vertex 1, which corresponds to 2 non-zero entries (at columns 2 and 4)."
  }
]