Получившийся [[Основные определения теории графов|ориентированный граф]] будет эйлеровым согласно [[Эйлеровость графов|критерию]].
{{Задача
|definition = High-level idea: Instead of storing the trees in the forest, store their Euler tours.
Each edge insertion or deletion translates into a set of manipulations on the Euler tours of the trees in the forest.<br>
Checking whether two nodes are connected can be done by checking if they're in the same Euler tour.
}}
==Свойства эйлерова обхода==
