Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update LCT.mdx #2897 #4561

Merged
merged 2 commits into from
Jun 28, 2024
Merged

Update LCT.mdx #2897 #4561

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9f47061
Update LCT.mdx
aarushk09 Jun 28, 2024
0b3caa7
Update LCT.mdx
SansPapyrus683 Jun 28, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 7 additions & 0 deletions content/6_Advanced/LCT.mdx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -75,6 +75,11 @@ When a node in a splay tree is accessed, a splay operation is performed on the n
title="Link Cut Tree Implementation"
url="https://github.com/bqi343/USACO/blob/master/Implementations/content/graphs%20(12)/Advanced/LCT.h"
/>
<Resource
source="CF"
title="Fully Dynamic Trees Supporting Path/Subtree Aggregates"
url="https://codeforces.com/blog/entry/103726"
/>
</Resources>

A link cut tree is a data structure that uses splay trees to represent a forest of rooted trees and
Expand All @@ -101,6 +106,8 @@ Adding an edge or removing an edge between two vertices are standard features of
Checking if there's a path between two nodes is the same as checking if they're part of the same tree.
To check if two nodes are part of the same tree, we can check if the roots of the trees of the two nodes are the same.

### Implementation

<LanguageSection>
<CPPSection>

Expand Down
Loading