Can anyone provide me some resources / link / explanation to understand the technique of finding all pair shortest path using Matrix Expo ?

During Google search I came across this link: http://mirror.codeforces.com/blog/entry/43225

But I couldn't get the idea. Sorry for my bad English. Thanks in advance :)