Let $\displaystyle A=\{2,4,6,8,10,12\}$. Let $\displaystyle R=\{(2,6),(2,12),(4,8),(6,4),(8,10),(10,6)\}$ be a relation on the set $\displaystyle A$. Use Warshall's algorithm to compute the transitive closure of $\displaystyle R$.

I regrettably cannot figure out Warshall's algorithm, primarily attributing to my being sick on the day of the lecture when it was taught to my class. Additionally, no source I've found has a quick-and-easy definition of it (though I doubt such a quick definition exists). The definitions I've found, also, are hard for me to understand (though it may just be due to my being tired right now).