Discussion @ 1022. Genealogical Tree @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1022. Genealogical Tree

what is the floyde-warshall

Posted by Xan Tei Jun 26 Oct 2009 12:37

Re: what is the floyde-warshall

Posted by Alex Tolstov (Vologda STU) 26 Oct 2009 16:30

It is an algorithm with complexity O(N^3) to find shortest distance between all vertices of a graph.

Re: what is the floyde-warshall

Posted by Xan Tei Jun 28 Oct 2009 11:59

Thaks a lot. I didn't notice this is an algorithm of Floid