From 9f47061846a2e4df4eb7894d51da49d14d767bc5 Mon Sep 17 00:00:00 2001 From: Aarush Kute <145231915+aarushk09@users.noreply.github.com> Date: Fri, 28 Jun 2024 12:57:33 -0400 Subject: [PATCH 1/2] Update LCT.mdx --- content/6_Advanced/LCT.mdx | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/content/6_Advanced/LCT.mdx b/content/6_Advanced/LCT.mdx index 2347c69a08..1e44adaad9 100644 --- a/content/6_Advanced/LCT.mdx +++ b/content/6_Advanced/LCT.mdx @@ -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 From 0b3caa7eaf39dbbe09d639e352e31e691beefd5f Mon Sep 17 00:00:00 2001 From: SansPapyrus683 <55369003+SansPapyrus683@users.noreply.github.com> Date: Fri, 28 Jun 2024 16:15:15 -0700 Subject: [PATCH 2/2] Update LCT.mdx --- content/6_Advanced/LCT.mdx | 2 ++ 1 file changed, 2 insertions(+) diff --git a/content/6_Advanced/LCT.mdx b/content/6_Advanced/LCT.mdx index 1e44adaad9..70199790d0 100644 --- a/content/6_Advanced/LCT.mdx +++ b/content/6_Advanced/LCT.mdx @@ -106,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>