READ_ONLY_ACCESS
[
  {
    "id": "maths1-w10-000",
    "front": "Handshaking Lemma for undirected graph $G = (V, E)$",
    "back": "$\\sum_{v \\in V} \\deg(v) = 2|E|$"
  },
  {
    "id": "maths1-w10-001",
    "front": "Maximum number of edges in simple undirected graph with $n$ vertices",
    "back": "$\\binom{n}{2} = \\frac{n(n-1)}{2}$"
  },
  {
    "id": "maths1-w10-002",
    "front": "Maximum number of directed edges in simple digraph with $n$ vertices",
    "back": "$n(n-1)$"
  },
  {
    "id": "maths1-w10-003",
    "front": "Breadth-First Search (BFS) primary data structure",
    "back": "Queue (FIFO) — finds shortest paths in unweighted graphs"
  },
  {
    "id": "maths1-w10-004",
    "front": "Depth-First Search (DFS) primary data structure",
    "back": "Stack (LIFO) or recursion"
  },
  {
    "id": "maths1-w10-005",
    "front": "Number of edges in a tree with $n$ vertices",
    "back": "$n - 1$"
  },
  {
    "id": "maths1-w10-006",
    "front": "DAG stands for",
    "back": "Directed Acyclic Graph"
  },
  {
    "id": "maths1-w10-007",
    "front": "A directed graph has a topological sort if and only if",
    "back": "It contains no directed cycles (it is a DAG)"
  }
]