refactor: move weighted_union_find from graph/ to data_structure/

Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>

Author: KKT89

…src/library/graph/weighted_union_find.md …ry/data_structure/weighted_union_find.mddocsrc/library/graph/weighted_union_find.md renamed to docsrc/library/data_structure/weighted_union_find.md docsrc/library/graph/weighted_union_find.md renamed to docsrc/library/data_structure/weighted_union_find.md

@@ -23,11 +23,11 @@ int  r   = uf.find(x);          // x の根
 ## Code
 
 ```cpp
---8<-- "include/graph/weighted_union_find.hpp"
+--8<-- "include/data_structure/weighted_union_find.hpp"
 ```
 
 ## Bundled (Copy & Paste)
 
 ```cpp
---8<-- "bundled/graph/weighted_union_find.hpp"
+--8<-- "bundled/data_structure/weighted_union_find.hpp"
 ```

docsrc/library/index.md

@@ -9,10 +9,13 @@
 - [Lowest Common Ancestor](tree/lowest_common_ancestor.md)
 - [Auxiliary Tree (Virtual Tree)](tree/auxiliary_tree.md)
 
+## Data Structure
+
+- [重み付き Union-Find](data_structure/weighted_union_find.md)
+
 ## Graph
 
 - [Bellman Ford (負閉路検出)](graph/bellman_ford.md)
-- [重み付き Union-Find](graph/weighted_union_find.md)
 
 ## String
 

docsrc/verify/aizu/3327.md

@@ -4,7 +4,7 @@
 
 ## Target Library
 
-- [Weighted Union Find](../../library/graph/weighted_union_find.md)
+- [Weighted Union Find](../../library/data_structure/weighted_union_find.md)
 
 ## Judge
 

docsrc/verify/index.md

@@ -4,7 +4,7 @@
 
 ## Aizu
 
-- ✅ [AOJ 3327 - Beam Beam Beam](aizu/3327.md) — 2026-02-28
+- ✅ [AOJ 3327 - Beam Beam Beam](aizu/3327.md) — 2026-03-03
 
 ## Library Checker
 

include/graph/weighted_union_find.hpp …e/data_structure/weighted_union_find.hppinclude/graph/weighted_union_find.hpp renamed to include/data_structure/weighted_union_find.hpp include/graph/weighted_union_find.hpp renamed to include/data_structure/weighted_union_find.hpp

@@ -3,13 +3,6 @@
 #include <string>
 #include <vector>
 
-/// @brief Z アルゴリズム
-///
-/// z[i] = s と s[i..] の最長共通接頭辞の長さ（z[0] = n）を O(n) で求める。
-/// std::string / std::vector<T> の両方に対応。
-///
-/// @param s  入力列
-/// @return   z 配列（長さ n、z[0] = n）
 template <class Container>
 std::vector<int> z_algorithm(const Container& s) {
     const int n = (int)s.size();

include/string/z_algorithm.hpp

@@ -82,9 +82,10 @@ nav:
       - Tree:
           - Lowest Common Ancestor: library/tree/lowest_common_ancestor.md
           - Auxiliary Tree (Virtual Tree): library/tree/auxiliary_tree.md
+      - Data Structure:
+          - 重み付き Union-Find: library/data_structure/weighted_union_find.md
       - Graph:
           - Bellman Ford (負閉路検出): library/graph/bellman_ford.md
-          - 重み付き Union-Find: library/graph/weighted_union_find.md
       - String:
           - Z Algorithm: library/string/z_algorithm.md
   - Verify:

mkdocs.yml

@@ -2,7 +2,7 @@
 using namespace std;
 typedef long long int ll;
 
-#include "graph/weighted_union_find.hpp"
+#include "data_structure/weighted_union_find.hpp"
 
 int main() {
     ios::sync_with_stdio(false);

verify/aizu/3327.cpp

@@ -6,8 +6,8 @@
     "title": "Lowest Common Ancestor"
   },
   "verify/aizu/3327.cpp": {
-    "bundled_hash": "sha256:4ed1498d39b78be0c3931458ba15123f77adffd21c83c9696b6ac62e0db9c4ae",
-    "verified_at": "2026-02-28T07:07:23+09:00",
+    "bundled_hash": "sha256:5277afa20d29e708e3aff74b81e0b3db5ffb3b37d2e42b80aa1ae0e4c24cfee5",
+    "verified_at": "2026-03-03T00:03:21+09:00",
     "judge_url": "https://onlinejudge.u-aizu.ac.jp/challenges/sources/VPC/HUPC/3327?year=2023",
     "title": "AOJ 3327 - Beam Beam Beam"
   }