ac-library-rb 0.6.1 → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 7f7674ea5a0a95f6cad7945415632a06bf91a515cde31d1c08320d5e9561fc0e
-  data.tar.gz: d6bb650ec23b99f6180f5e8413644863dae78c7923d79249bcadcb9a8a1fcaa0
+  metadata.gz: 22006092d0cd212252ead6bc78fa5e37c6561f2fc9117d2bb92c9bc35d9652b2
+  data.tar.gz: 8ffdfae56a8b4065ae0698d1a99082554cddc63793847f526ce1b97b56dce7e5
 SHA512:
-  metadata.gz: d549b2be1fa15a519b8e1d692bbbd03ccd6c0f0b2d94787dbdc48c44ce9274c92ed5e7d6148c195ef73a545ba9951a64f74e84f39eed62e6c12a2eaaf386fcb9
-  data.tar.gz: 5f2b39beb3aacb21ac0fec142b550baf20b6343ed4fabce3ca303d8466bd632af71ce33d911b6a0494425234afa928949d33a670d490a91f9f5441c535586ae4
+  metadata.gz: 7786082b3706d8f4381e544d506e55fbc846621c34c91342b6248110a9d6310eff38e6f2d5d2d3230d10580a331439a4e027af2b43e0bdb38f9f150695df759f
+  data.tar.gz: 3dfc4a42e293c08699c9e8926114ee757f1b501988672a862760545d155d91632985d36a10e0b0fd8a3aa654f68fb975baccccb37cb09d0c6313e82748ee6898

data/.github/workflows/unittest.yml

@@ -1,16 +1,29 @@
 name: Unittest
 
-on: [push, pull_request]
+on:
+  push:
+    paths-ignore:
+      - 'document_*/**/*'
+      - 'README.*'
+  pull_request:
+    paths-ignore:
+      - 'document_*/**/*'
+      - 'README.*'
 jobs:
   unittest:
     runs-on: ${{ matrix.os }}
     strategy:
       matrix:
         os: [macos-latest, ubuntu-latest, windows-latest]
+        ruby: [2.7, 3.1]
     steps:
       - uses: actions/checkout@v2
       - uses: ruby/setup-ruby@v1
         with:
-          ruby-version: 2.7.1
+          ruby-version: ${{ matrix.ruby }}
+      - name: insall by bundler
+        run: bundle install
       - name: run unittests
-        run: ruby test/*.rb
+        run: bundle exec ruby test/*.rb
+      - name: Upload coverage to Codecov
+        uses: codecov/codecov-action@v3

data/.rubocop.yml

@@ -1,15 +1,16 @@
 AllCops:
   NewCops: enable
+  TargetRubyVersion: 2.7
   Exclude:
     - 'lib_lock/ac-library-rb/*.rb'
+
+## Layout
+
 Layout/ExtraSpacing:
   AutoCorrect: false
   Exclude:
     - 'ac-library-rb.gemspec'
     - 'test/convolution_test.rb'
-Layout/LineLength:
-  Exclude:
-    - 'ac-library-rb.gemspec'
 Layout/SpaceAroundOperators:
   Exclude:
     - 'ac-library-rb.gemspec'
@@ -21,6 +22,9 @@ Layout/SpaceInsideArrayLiteralBrackets:
     - 'test/convolution_test.rb'
 Layout/SpaceInsideRangeLiteral:
   Enabled: false
+
+## Lint
+
 Lint/AmbiguousOperator:
   AutoCorrect: false
   Exclude:
@@ -29,8 +33,27 @@ Lint/AmbiguousOperator:
 Lint/AmbiguousBlockAssociation:
   AutoCorrect: false
   Exclude:
+    - 'bin/lock_lib.rb'
     - 'test/convolution_test.rb'
     - 'test/crt_test.rb'
+Lint/AmbiguousOperatorPrecedence:
+  Enabled: false
+Lint/AmbiguousRegexpLiteral:
+  Exclude:
+    - 'test/priority_queue_test.rb'
+Lint/AmbiguousRange:
+  Exclude:
+    - 'lib/convolution.rb'
+    - 'test/convolution_test.rb'
+    - 'test/crt_test.rb'
+    - 'test/lcp_array_test.rb'
+    - 'test/suffix_array_test.rb'
+    - 'test/z_algorithm_test.rb'
+Lint/AssignmentInCondition:
+  Exclude:
+    - 'lib/fenwick_tree.rb'
+    - 'lib/lazy_segtree.rb'
+    - 'lib/segtree.rb'
 Lint/BinaryOperatorWithIdenticalOperands:
   Enabled: false
 Lint/MissingSuper:
@@ -52,42 +75,23 @@ Lint/ShadowingOuterLocalVariable:
     - 'test/crt_test.rb'
     - 'test/lcp_array_test.rb'
     - 'test/example/suffix_array_and_lcp_array_practice.rb'
-Lint/UnderscorePrefixedVariableName:
-  AutoCorrect: false
-  Exclude:
-    - 'lib/max_flow.rb'
 Lint/Void:
   AutoCorrect: false
   Exclude:
     - 'test/example/*'
-Metrics/AbcSize:
-  Max: 50
-  Exclude:
-    - 'lib/suffix_array.rb'
-    - 'test/modint_test.rb'
-Metrics/BlockLength:
-  Exclude:
-    - 'test/segtree_test.rb'
-Metrics/BlockNesting:
-  Exclude:
-    - 'lib/max_flow.rb'
-Metrics/ClassLength:
-  Max: 334
-Metrics/CyclomaticComplexity:
-  Max: 13
-  Exclude:
-    - 'lib/suffix_array.rb'
-Metrics/MethodLength:
-  Max: 120
-Metrics/ParameterLists:
-  Exclude:
-    - 'lib/lazy_segtree.rb'
-Metrics/PerceivedComplexity:
-  Max: 13
-  Exclude:
-    - 'lib/suffix_array.rb'
+
+
+## Metrics
+
+Metrics:
+  Enabled: false
+
+
+## Naming
+
 Naming/FileName:
   Exclude:
+    - 'lib_helpers/ac-library-rb.rb'
     - 'lib_lock/ac-library-rb.rb'
 Naming/AccessorMethodName:
   Exclude:
@@ -104,10 +108,11 @@ Naming/MethodParameterName:
 Naming/VariableNumber:
   Exclude:
     - 'test/max_flow_test.rb'
-Style/AndOr:
-  Enabled: false
-Style/ArrayCoercion:
-  Enabled: false
+    - 'test/scc_test.rb'
+
+
+## Style
+
 Style/BlockDelimiters:
   AutoCorrect: false
   Exclude:
@@ -121,9 +126,14 @@ Style/BlockDelimiters:
     - 'test/z_algorithm_test.rb'
 Style/Documentation:
   Enabled: false
-tyle/EmptyElse:
+Style/EachForSimpleLoop:
+  Enabled: false
+Style/EmptyElse:
   Exclude:
     - 'test/segtree_test.rb'
+Style/FormatString:
+  Exclude:
+    - 'lib/convolution.rb'
 Style/GlobalVars:
   AutoCorrect: false
   Exclude:
@@ -131,6 +141,16 @@ Style/GlobalVars:
     - 'test/lazy_segtree_test.rb'
 Style/FrozenStringLiteralComment:
   Enabled: false
+Style/GuardClause:
+  Exclude:
+    - 'lib/lazy_segtree.rb'
+Style/IdenticalConditionalBranches:
+  Enabled: false
+Style/IfUnlessModifier:
+  Exclude:
+    - 'lib/crt.rb'
+    - 'lib/dsu.rb'
+    - 'lib/two_sat.rb'
 Style/InfiniteLoop:
   Exclude:
     - 'lib/floor_sum.rb'
@@ -147,7 +167,7 @@ Style/HashSyntax:
     - 'Rakefile'
 Style/MixinUsage:
   Exclude:
-    - 'lib_lock/ac-library-rb.rb'
+    - 'lib_helpers/ac-library-rb.rb'
 Style/MultipleComparison:
   Enabled: false
 Style/NegatedIf:
@@ -168,6 +188,8 @@ Style/ParallelAssignment:
   Enabled: false
 Style/RedundantFileExtensionInRequire:
   Enabled: false
+Style/RaiseArgs:
+  Enabled: false
 Style/RedundantReturn:
   AutoCorrect: false
   Exclude:
@@ -200,11 +222,5 @@ Style/StringConcatenation:
     - 'bin/lock_lib.rb'
 Style/StringLiterals:
   Enabled: false
-Style/TrailingCommaInArrayLiteral:
-  Enabled: false
-Style/WordArray:
-  Enabled: false
-Style/WhileUntilModifier:
-  Enabled: false
 Style/YodaCondition:
   Enabled: false

data/README.ja.md

@@ -1,6 +1,15 @@
+### Other language English version(英語バージョン)
+
+This file is for Japanese to read.  
+The following files are written in English: (英語で読みたい方は次のファイルを)
+- [README.md (ver. English)](README.md)
+
 # ac-library-rb
 
 [![Gem Version](https://badge.fury.io/rb/ac-library-rb.svg)](https://badge.fury.io/rb/ac-library-rb)
+[![codecov](https://codecov.io/gh/universato/ac-library-rb/branch/main/graph/badge.svg?token=NUAIDTMGBE)](https://codecov.io/gh/universato/ac-library-rb)
+
+<img width="560" src="ac-library-rb_header.jpg" alt="ac-library-rb Logo">
 
 ac-library-rbは、AtCoder Library (ACL)のRuby版です。
 
@@ -50,7 +59,7 @@ bundlerをインストールしてない場合は、`gem install bundler`とい
 
 次に、ac-library-rbを使いたいディレクトリ配下にGemfileを置きます。Gemfileという名称のファイルです。  
 このGemfileの中で、次のように書きます。
-```
+```ruby
 gem "ac-library-rb"
 ```
 そして、`budnle install`というコマンドにより、Gemfileに書かれたac-library-rbをインストールします。
@@ -104,7 +113,7 @@ ACL本家のレポジトリ名がac-libraryとハイフン区切りで、それ
 
 現在、AtCoderのRubyバージョンは、2.7.1です。
 
-そのため、2.7.1を推奨し、それ以外のバージョンでは動かない可能性があります。
+そのため、2.7と最新の3.1でテストをしています。
 
 ただ、開発される方は2.7より古くても動かせるようNumbered parametersなどの使用は控えてもらえると嬉しいです。
 
@@ -116,25 +125,44 @@ ACL本家のレポジトリ名がac-libraryとハイフン区切りで、それ
 
 宣伝・バグ報告などしてもらえると嬉しいです。
 
-## ac-library-rbを開発したい方向けの情報
+## ac-library-rbを開発したい方向けの情報(CONTRIBUTEING)
 
 ### コーディングスタイル
 
-Rubocop(Rubyのlintツール)の設定ファイル`.rubocop.yml`は、参考に置いています。  
-Rubocopのルールを守ることが必ずしもよくなかったり、ルールを守ることが難しかったりもするので、Rubocopの適用は必須ではないです。  
-
 推奨スタイル
 - インデントは、半角スペース2文字
 - 行末の余計なスペースは削除
 
+RuboCopを使用できる方は、使用してもらえるとありがたいです。  
+使い方のわからない方は、使う必要がないです。  
+
+```console
+$gem install rubocop
+```
+上記の方法でrubocopをインストールします。
+
+```console
+$rubocop    <- チェック
+$rubocop -a <- 安全に直せるところは自動で修正
+$rubocop -A <- 安全でない可能性のところも自動で修正
+```
+
 ### ディレクトリの説明
 
 `lib`ディレクトリ内に各種のデータ構造などのライブラリがあります。  
 `lib_lock`は、Gem用にモジュール化させるため`lib`の内容をコピーする形でモジュール化させています。  
-`bin/lock_lib.rb`を実行することで、`lib`から`lib_lock`にモジュール化させる形でコピーします。  
+[`bin/lock_lib.rb`](./bin/lock_lib.rb)を実行することで、`lib`から`lib_lock`にモジュール化させる形でコピーします。  
+`rake copy`コマンドを実行すると、[`bin/lock_lib.rb`](./bin/lock_lib.rb)が実行されるため、この2つは同等です。
+
 なお、`rake`コマンドでテストを実行させると、自動的に`require_relative "./bin/lock_lib.rb"`により、コピーが行われます。  
 このあたりはトリッキーで、予定は未定ですが、今後全てモジュール化される等に統一される可能性があります。  
 
+```
+$ rake copy <- `lib`に変更があれば、`./lib_lokc`を更新する。
+$ rake test <- 全てのテストを実行
+$ rake      <- 上2つのcopy & testを実行
+```
+
 ## その他の情報
 
 ### RubyのSlackのAtCoderチャンネル
@@ -143,7 +171,7 @@ Rubocopのルールを守ることが必ずしもよくなかったり、ルー
 
 ここで、バグ報告などすると、競プロ詳しい人などが反応しやすいかもしれません。
 
-Slackに3000人、atcoderチャンネルに250人以上の登録者がいるので、お気軽に参加してください。
+Slackに4000人近く、atcoderチャンネルに350人ほどの登録者がいるので、お気軽に参加してください。
 
 ### 他言語のライブラリ
 

data/README.md

@@ -1,13 +1,16 @@
-# Other language Japanese version
+### Other language Japanese version(ver. 日本語)
 
 [README 日本語バージョン(ver. Japanese)](README.ja.md)
 - [ライブラリ目次: index.md](https://github.com/universato/ac-library-rb/blob/master/document_ja/index.md)
 
 <hr>
 
-# ac-library-rb
+# ac-library-rb  
 
 [![Gem Version](https://badge.fury.io/rb/ac-library-rb.svg)](https://badge.fury.io/rb/ac-library-rb)
+[![codecov](https://codecov.io/gh/universato/ac-library-rb/branch/main/graph/badge.svg?token=NUAIDTMGBE)](https://codecov.io/gh/universato/ac-library-rb)
+
+<img width="560" src="ac-library-rb_header.jpg" alt="ac-library-rb Logo">
 
 ac-library-rb is a ruby port of AtCoder Library (ACL).
 
@@ -21,7 +24,7 @@ See below for ACL.
 
 Currently, the Ruby version in AtCoder is 2.7.1.
 
-Therefore, 2.7.1 is recommended and may not work with other versions.
+Therefore, 2.7 and the latest 3.1 are tested.
 
 # Document
 
@@ -90,7 +93,7 @@ Note that the gem names are separated by hyphens, but the library names in ac-li
 In general, underscores are recommended for Ruby library names.
 However, the repository names in the original ACL are separated by a hyphen, ac-library, so ac-library-rb is also separated by a hyphen.
 
-## Development
+## Development: How to Contirubute
 
 After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
 

data/Rakefile

@@ -1,12 +1,16 @@
 require "bundler/gem_tasks"
 require "rake/testtask"
 
-Rake::TestTask.new(:test) do |t|
-  require_relative "./bin/lock_lib.rb" # for copy
+Rake::TestTask.new :copy do
+  # for make ./lib_lock to use ./lib
+  require_relative "./bin/lock_lib.rb"
+end
+
+Rake::TestTask.new :test do |t|
   t.warning = false
   t.libs << "test"
   t.libs << "lib"
   t.test_files = FileList["test/**/*_test.rb"]
 end
 
-task :default => :test
+task :default => %i[copy test]

data/ac-library-rb.gemspec

@@ -1,7 +1,10 @@
 require_relative 'lib/ac-library-rb/version'
 
-gem_description = "ac-library-rb is a ruby port of AtCoder Library (ACL).
-DSU(UnionFind), FenwickTree, PriorityQueue, Segtree, SCC, 2-SAT, suffix_array, lcp_array, z_algorithm, crt, inv_mod, floor_sum, max_flow, min_cost_flow......"
+gem_description = <<~DESCRIPTION
+  ac-library-rb is a ruby port of AtCoder Library (ACL).
+  DSU(UnionFind), FenwickTree, PriorityQueue, Segtree, SCC, 2-SAT,
+  suffix_array, lcp_array, z_algorithm, crt, inv_mod, floor_sum, max_flow, min_cost_flow......
+DESCRIPTION
 
 Gem::Specification.new do |spec|
   spec.name          = "ac-library-rb"
@@ -13,14 +16,18 @@ Gem::Specification.new do |spec|
   spec.description   = gem_description
   spec.homepage      = "https://github.com/universato/ac-library-rb"
   spec.license       = "CC0"
-  spec.required_ruby_version = Gem::Requirement.new(">= 2.5.0")
+  spec.required_ruby_version = Gem::Requirement.new(">= 2.7.0")
 
   spec.metadata["homepage_uri"] = spec.homepage
   spec.metadata["source_code_uri"] = "https://github.com/universato/ac-library-rb"
+  spec.metadata['rubygems_mfa_required'] = 'true'
+
+  spec.add_dependency "prime"
 
   spec.add_development_dependency "minitest"
   spec.add_development_dependency "rake"
   spec.add_development_dependency "simplecov"
+  spec.add_development_dependency 'simplecov-cobertura'
 
   # Specify which files should be added to the gem when it is released.
   # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
@@ -29,5 +36,5 @@ Gem::Specification.new do |spec|
   end
   spec.bindir        = "exe"
   spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
-  spec.require_paths = ["lib_lock", "lib_helpers"]
+  spec.require_paths = %w[lib_lock lib_helpers"]
 end

data/bin/console

@@ -2,7 +2,7 @@
 
 require "bundler/setup"
 
-require "ac-library-rb"
+require_relative "../lib_helpers/ac-library-rb/all.rb"
 
 require "irb"
 IRB.start(__FILE__)

data/document_en/dsu.md

@@ -120,7 +120,7 @@ More precisely, it returns the list of the "list of the vertices in a connected
 
 ## Verified
 
-[A \- Disjoint Set Union](https://atcoder.jp/contests/practice2/tasks/practice2_a)
+[A - Disjoint Set Union](https://atcoder.jp/contests/practice2/tasks/practice2_a)
 
 ## Links & Reference
 

data/document_en/fenwick_tree.md

@@ -83,9 +83,9 @@ It returns `a[0] + a[1] + ... + a[pos - 1]`.
 
 ## Verified
 
-- [AtCoder ALPC B \- Fenwick Tree](https://atcoder.jp/contests/practice2/tasks/practice2_b)
+- [AtCoder ALPC B - Fenwick Tree](https://atcoder.jp/contests/practice2/tasks/practice2_b)
   -  [AC Code(1272ms)](https://atcoder.jp/contests/practice2/submissions/17074108)
-- [F \- Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
+- [F - Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
   - [AC Code(821ms)](https://atcoder.jp/contests/abc185/submissions/18769200)
 
 

data/document_en/lazy_segtree.md

@@ -2,7 +2,7 @@
 
 This is a lazy evaluation segment tree.
 
-## Class Methods.
+## Class Methods
 
 ### new(v, e, id, op, mapping, composition)
 
@@ -21,7 +21,7 @@ The second argument `e` is the unit source. We need to define the monoid by defi
 
 - `O(n)`
 
-## Instance methods.
+## Instance methods
 
 ## set(pos, x)
 
@@ -136,8 +136,8 @@ This is the link in question. There is no code, but it has been Verified.
 - [AIZU ONLINE JUDGE DSL\_2\_G RSQ and RAQ](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G)
 
 The following problem is not AC in Ruby because the execution time is strictly TLE.
-- [ALPC: K \- Range Affine Range Sum](https://atcoder.jp/contests/practice2/tasks/practice2_k)
-- [ALPC: L \- Lazy Segment Tree](https://atcoder.jp/contests/practice2/tasks/practice2_l)
+- [ALPC: K - Range Affine Range Sum](https://atcoder.jp/contests/practice2/tasks/practice2_k)
+- [ALPC: L - Lazy Segment Tree](https://atcoder.jp/contests/practice2/tasks/practice2_l)
 
 ## Reference links
 

data/document_en/math.md

@@ -65,7 +65,7 @@ If there is a solution, all the solutions can be written as the form `x ≡ rem(
 ## Verified
 
 Problems
-- [No\.187 中華風 \(Hard\) \- yukicoder](https://yukicoder.me/problems/no/187)
+- [No\.187 中華風 \(Hard\) - yukicoder](https://yukicoder.me/problems/no/187)
 
 ## floor_sum(n, m, a, b)
 
@@ -79,7 +79,7 @@ It retrurns `Σ[k = 0 → n - 1] floor((a * i + b) / m)`
 
 ## Verified
 
-[ALPC: C \- Floor Sum](https://atcoder.jp/contests/practice2/tasks/practice2_c)
+[ALPC: C - Floor Sum](https://atcoder.jp/contests/practice2/tasks/practice2_c)
  - [AC Code 426ms 2020/9/14](https://atcoder.jp/contests/practice2/submissions/16735215)
 
 ## 参考リンク
@@ -101,4 +101,4 @@ It retrurns `Σ[k = 0 → n - 1] floor((a * i + b) / m)`
   - [Test math_test.cpp](https://github.com/atcoder/ac-library/blob/master/test/unittest/math_test.cpp)
   - [Document math.md](https://github.com/atcoder/ac-library/blob/master/document_ja/math.md)
   - [Document math.html](https://atcoder.github.io/ac-library/document_en/math.html)
-  - [Relax the constraints of floor\_sum? · Issue \#33 · atcoder/ac\-library](https://github.com/atcoder/ac-library/issues/33)
+  - [Relax the constraints of floor\_sum? · Issue \#33 · atcoder/ac-library](https://github.com/atcoder/ac-library/issues/33)

data/document_en/max_flow.md

@@ -3,7 +3,7 @@
 Library for solving [Maximum flow problem](https://en.wikipedia.org/wiki/Maximum_flow_problem).
 
 
-## Class Methods.
+## Class Methods
 
 ### new(n) -> MaxFlow
 
@@ -17,7 +17,7 @@ It creates a graph of `n` vertices and `0` edges.
 
 - `O(n)`
 
-## Instance Methods.
+## Instance Methods
 
 ### add_edge(from, to, cap) -> Integer
 
@@ -122,7 +122,7 @@ Change the capacity and flow rate of the `i`-th changed edge to `new_cap` and `n
 
 ## Verified.
 
-- [ALPC: D \- Maxflow](https://atcoder.jp/contests/practice2/tasks/practice2_d)
+- [ALPC: D - Maxflow](https://atcoder.jp/contests/practice2/tasks/practice2_d)
   - [AC Code 211ms 2020/9/17](https://atcoder.jp/contests/practice2/submissions/16789801)
   - [ALPC: D \fnDroid Sans Fallback - Qiita](https://qiita.com/magurofly/items/bfaf6724418bfde86bd0)
 

data/document_en/min_cost_flow.md

@@ -1,8 +1,8 @@
 # MinCostFlow
 
-It solves [Minimum\-cost flow problem](https://en.wikipedia.org/wiki/Minimum-cost_flow_problem).
+It solves [Minimum-cost flow problem](https://en.wikipedia.org/wiki/Minimum-cost_flow_problem).
 
-## Class Methods.
+## Class Methods
 
 ### new(n) -> MinCostFlow
 
@@ -23,7 +23,7 @@ Verticle order is the 0-based index.
 - `O(n)`
 
 
-## Instance Methods.
+## Instance Methods
 
 ### add_edge(from, to, cap, cost) -> Integer
 
@@ -100,7 +100,7 @@ It returns an array containing information on all edges.
 
 ## Verified
 
-- [ALPC: E\- MinCostFlow](https://atcoder.jp/contests/practice2/tasks/practice2_e)
+- [ALPC: E- MinCostFlow](https://atcoder.jp/contests/practice2/tasks/practice2_e)
   - [1213ms 2020/9/17](https://atcoder.jp/contests/practice2/submissions/16792967)
 
 ## Reference links

data/document_en/modint.md

@@ -127,7 +127,7 @@ This is a constructor for constant-fold speedup.
 
 If `val` is guaranteed to be greater than or equal to `0` and not exceed `mod`, it is faster to generate `ModInt` here.
 
-## Instance methods.
+## Instance Methods
 
 ### val -> Integer
 
@@ -204,9 +204,9 @@ The `Integer` to be compared returns true or false in the range of [0, mod), but
 
 ## Verified
 
-- [ABC156: D \- Bouquet](https://atcoder.jp/contests/abc156/tasks/abc156_d) held on 2020/2/22
+- [ABC156: D - Bouquet](https://atcoder.jp/contests/abc156/tasks/abc156_d) held on 2020/2/22
   - [AC Code 138ms 2020/10/5](https://atcoder.jp/contests/abc156/submissions/17205940)
-- [ARC009: C \- Takahashi, 24 years old](https://atcoder.jp/contests/arc009/tasks/arc009_3) held on 2012/10/20
+- [ARC009: C - Takahashi, 24 years old](https://atcoder.jp/contests/arc009/tasks/arc009_3) held on 2012/10/20
   - [AC Code 1075ms 2020/10/5](https://atcoder.jp/contests/arc009/submissions/17206081)
   - [AC code 901ms 2020/10/5](https://atcoder.jp/contests/arc009/submissions/17208378)
 
@@ -227,7 +227,7 @@ The methods `+`, `-`, `*`, and `/` use the methods `add!`, `sub!`, `mul!`, and `
   - [class Numeric \(Ruby 2\.7\.0 Reference Manual\)](https://docs.ruby-lang.org/ja/latest/class/Numeric.html)
 - Others
   - [Why don't you try using the modint struct? \(C\cH000000)}Noshi91's Notes](https://noshi91.hatenablog.com/entry/2019/03/31/174006)(Mar 31, 2019)
-  - [Implementing modint in Python \- Qiita](https://qiita.com/wotsushi/items/c936838df992b706084c)(Apr 1, 2019)
+  - [Implementing modint in Python - Qiita](https://qiita.com/wotsushi/items/c936838df992b706084c)(Apr 1, 2019)
   - [Documentation of the C# version of ModInt](https://github.com/key-moon/ac-library-cs/blob/master/document_ja/modint.md)
 
 

data/document_en/scc.md

@@ -0,0 +1,67 @@
+# SCC
+
+Strongly Connected Components
+
+It calculates the strongly connected components of directed graph.
+
+## Class Methods
+
+### new(n) -> SCC
+
+```ruby
+graph = SCC.new(6)
+```
+
+It creates a directed graph of `n` vertices and `0` edges.
+
+This `n` is 0-based index.
+
+**Constraints** `0 ≦ n`
+
+**Complexity** $O(n)$
+
+## Instance Methods
+
+### add_edge(from, to)
+
+```ruby
+graph.add_edge(1, 4)
+```
+
+It adds a directed edge from the vertex `from` to the vertex `to`.
+
+**Constraints**  `0 ≦ from < n`, `0 ≦ to < n`
+
+**Complexity** $O(n)$
+
+### scc -> Array[Array[Integer]]
+
+```ruby
+graph.scc
+```
+
+It returns the array of the "array of the vertices" that satisfies the following.
+
+- Each vertex is in exactly one "array of the vertices".
+- Each "array of the vertices" corresponds to the vertex set of a strongly connected component. The order of the vertices in the list is undefined.
+- The array of "array of the vertices" are sorted in topological order, i.e., for two vertices $u, v$ in different strongly connected components, if there is a directed path from $u$ to $v$, the list contains uu appears earlier than the list contains $v$.
+
+
+
+**Complexity**  $O(n + m)$ , where $m$ is the number of added edges.
+
+## Verified
+
+- [ALPC: G - SCC](https://atcoder.jp/contests/practice2/tasks/practice2_g)  
+  - [Ruby 2.7 1848ms 2022/11/22](https://atcoder.jp/contests/practice2/submissions/36708506)
+- [typical90: 021 - Come Back in One Piece](https://atcoder.jp/contests/typical90/tasks/typical90_u)
+  - [Ruby2.7 471ms 2021/6/15](https://atcoder.jp/contests/typical90/submissions/23487102)
+
+# 参考リンク
+
+- ac-library-rb
+  - [scc.rb](https://github.com/universato/ac-library-rb/blob/master/lib/scc.rb)
+  - [scc_test.rb](https://github.com/universato/ac-library-rb/blob/master/test/scc_test.rb)
+- Original C++
+  - [Original C++ code scc.hpp](https://github.com/atcoder/ac-library/blob/master/atcoder/scc.hpp)
+  - [Original document scc.md](https://github.com/atcoder/ac-library/blob/master/document_en/scc.md)