This is the natural next topic after graphs and shortest paths. 1. Union-Find / Disjoint Set Union (DSU) Union-Find is used when you need to repeatedly answer: “Are these two nodes in the same connected group?” and merge groups together. Core operations find(x) → which group does x belong to? union(a, b) → merge the groups containing a and b 2.... Weiterlesen: 14. Union-Find (DSU) + Minimum Spanning Trees
Intelligence View
⚡ tsecurity.de Intelligence
14. Union-Find (DSU) + Minimum Spanning Trees
This is the natural next topic after graphs and shortest paths. 1. Union-Find / Disjoint Set Union (DSU) Union-Find is used when you need to repeatedly answer:…