Suppose a database schedule S involves transactions $T1, T2, \dots,Tn$. Consider the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?
- Topological order
- Depth – first order
- Breadth – first order
- Ascending order of transactions indices