Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1311-7126-0 |
Объём: | 76 страниц |
Масса: | 135 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
High Quality Content by WIKIPEDIA articles! The basic idea of the algorithm is this: a depth-first search begins from a start node. The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components. The nodes are placed on a stack in the order in which they are visited. When the search returns from a subtree, the nodes are taken from the stack and it is determined whether each node is the root of a strongly connected component. If a node is the root of a strongly connected component, then it and all of the nodes taken off before it form that strongly connected component.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.