Search found 1 match
Search found 1 match • Page 1 of 1
- Tue Oct 18, 2005 12:15 am
- Forum: Volume 109 (10900-10999)
- Topic: 10938 - Flea circus
- Replies: 14
- Views: 8190
sorry for duplicating this post from another thread, but this one seems to be alive :) My approach is to make DFS once and fill the s array with the previous of every vertex. Then for every case construct the path for the deeper and shallower vertex, then find the least common ancestor (the only way...