# Serialization Graph

Wooo, this is one of the super useful applications of Graph Theory.

Learned in CS348.

Serialization Graph

A serialization graph $SG(N,E)$ for a schedule $S$ is a directed graph with

- nodes $T_{i}∈N$, corresponding to the transactions of $S$, and
- edges $T_{i}→T_{j}∈E$ whenever an operation $o_{i}[x]$ for transaction $T_{i}$ occurs prior to an operation $o_{j}[x]$ for transaction $T_{j}$ in $S$, where $o_{i}[x]$ and $o_{j}[x]$ are conflicting operations.

Ahh yess I get it, it is VERY easy