ENG
RUS
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
back to board
Discussion of Problem
1022
. Genealogical Tree
Xan Tei Jun
what is the floyde-warshall
[2] // Problem
1022. Genealogical Tree
26 Oct 2009 12:37
Alex Tolstov (Vologda STU)
Re: what is the floyde-warshall
[1] // Problem
1022. Genealogical Tree
26 Oct 2009 16:30
It is an algorithm with complexity O(N^3) to find shortest distance between all vertices of a graph.
Xan Tei Jun
Re: what is the floyde-warshall
// Problem
1022. Genealogical Tree
28 Oct 2009 11:59
Thaks a lot. I didn't notice this is an algorithm of Floid
© 2000–2024
Timus Online Judge Team
. All rights reserved.