Precedence Graph


I’m not sure if someone will answer this question but i will ask anyway.

Basically i am trying to understand precedence graphs in terms of serializability.

Lets say for example i have the following transaction schedules:-

read(T1, balx), write(T1, balx), read(T2, balx), write(T2, balx), read(T3, balx), commit(T1), commit(T2), commit(T3)

Whats the best way to work out how the nodes will be presented? I dont know how to link which nodes to what?

Can someone help?