A Simple and Efficient Union-Find-Delete Algorithm - Corelab
A Simple and Efficient Union-Find-Delete Algorithm - Corelab
A Simple and Efficient Union-Find-Delete Algorithm - Corelab
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
• If node x is the leftmost child of its parent,<br />
we do not have to change the DFS order<br />
at all<br />
7<br />
x<br />
1<br />
8<br />
6<br />
5<br />
3<br />
2<br />
DFS<br />
7<br />
1<br />
6<br />
8<br />
x<br />
2<br />
3<br />
5<br />
…
Change language