Аннотация к книге "Tarjans Off-Line Least Common Ancestors Algorithm"
High Quality Content by WIKIPEDIA articles! In computer science, Tarjan's off-line least common ancestors algorithm (more precisely, least should actually be lowest) is an algorithm for computing lowest common ancestors for pairs of nodes in a tree, based on the union-find data structure. The lowest common ancestor of two nodes d and e in a rooted tree T is the node g that is an ancestor of both d and e and that has the greatest depth in T. It is named after Robert Tarjan, who discovered the...
High Quality Content by WIKIPEDIA articles! In computer science, Tarjan's off-line least common ancestors algorithm (more precisely, least should actually be lowest) is an algorithm for computing lowest common ancestors for pairs of nodes in a tree, based on the union-find data structure. The lowest common ancestor of two nodes d and e in a rooted tree T is the node g that is an ancestor of both d and e and that has the greatest depth in T. It is named after Robert Tarjan, who discovered the technique in 1979. Tarjan's algorithm is offline; that is, unlike other lowest common ancestor algorithms, it requires that all pairs of nodes for which the lowest common ancestor is desired must be specified in advance. The simplest version of the algorithm uses the union find data structure, which unlike other lowest common ancestor data structures can take more than constant time per operation when the number of pairs of nodes is similar in magnitude to the number of nodes. A later refinement by Gabow
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.
Социальные сети давно стали неотъемлемой частью нашей жизни. Мы делимся фотографиями, публикуем и комментируем посты, подписываемся на интересующие нас сообщества, добавляем новых друзей и знакомых. Анализ информации, которую человек транслирует обществу через профиль в социальных сетях, позволяет сделать выводы о его личности. И даже закрытый профиль может кое-что рассказать о своем владельце. ...
Оставить комментарий