ac-library-rb 0.7.0 → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 92f162f1c30df36b5602b074dc6c93dcb850a9f528cf3a81aea5d28c7d6e25b7
-  data.tar.gz: 54d7ee1109261c6e873fa30d7c2d778702f942037aa9e4ed2597d624af7c5c4c
+  metadata.gz: 22006092d0cd212252ead6bc78fa5e37c6561f2fc9117d2bb92c9bc35d9652b2
+  data.tar.gz: 8ffdfae56a8b4065ae0698d1a99082554cddc63793847f526ce1b97b56dce7e5
 SHA512:
-  metadata.gz: 4bbf58133808113aeaca23eadc803bdd5a6d7f6834137c5e01dcc23b5a61e4d7e718ee37bed8dc27f967b3d63162cf584ef0e5ba508e315fb020d7e1fad7b0b1
-  data.tar.gz: 40143c6a526626d086d3f639f1b6d8c95c4da9a3407249118bd8cf6837436c2741a34ff806285137598003debc95a3853337d863da567f24c9e637597982e3a9
+  metadata.gz: 7786082b3706d8f4381e544d506e55fbc846621c34c91342b6248110a9d6310eff38e6f2d5d2d3230d10580a331439a4e027af2b43e0bdb38f9f150695df759f
+  data.tar.gz: 3dfc4a42e293c08699c9e8926114ee757f1b501988672a862760545d155d91632985d36a10e0b0fd8a3aa654f68fb975baccccb37cb09d0c6313e82748ee6898

data/lib/ac-library-rb/version.rb

@@ -1,3 +1,3 @@
 module AcLibraryRb
-  VERSION = "0.7.0".freeze
+  VERSION = "1.0.0".freeze
 end

data/lib/scc.rb

@@ -3,7 +3,7 @@ class SCC
   # initialize graph with n vertices
   def initialize(n)
     @n = n
-    @edges = []
+    @edges = Array.new(n) { [] }
   end
 
   # add directed edge
@@ -13,7 +13,7 @@ class SCC
       raise ArgumentError.new(msg)
     end
 
-    @edges << [from, to]
+    @edges[from] << to
     self
   end
 
@@ -28,7 +28,7 @@ class SCC
 
   # returns list of strongly connected components
   # the components are sorted in topological order
-  # O(@n + @edges.size)
+  # O(@n + @edges.sum(&:size))
   def scc
     group_num, ids = scc_ids
     groups = Array.new(group_num) { [] }
@@ -39,47 +39,49 @@ class SCC
   private
 
   def scc_ids
-    start, elist = csr
-    now_ord = group_num = 0
-    visited, low, ord, ids = [], [], [-1] * @n, []
-    dfs = ->(v) {
-      low[v] = ord[v] = now_ord
-      now_ord += 1
-      visited << v
-      (start[v]...start[v + 1]).each do |i|
-        to = elist[i]
-        low[v] = if ord[to] == -1
-                   dfs.(to)
-                   [low[v], low[to]].min
-                 else
-                   [low[v], ord[to]].min
-                 end
-      end
-      if low[v] == ord[v]
-        loop do
-          u = visited.pop
-          ord[u] = @n
-          ids[u] = group_num
+    now_ord = 0
+
+    visited = []
+    low = Array.new(@n, 1 << 60)
+    ord = Array.new(@n, -1)
+    group_num = 0
+
+    (0...@n).each do |v|
+      next if ord[v] != -1
+
+      stack = [[v, 0]]
+
+      while (v, i = stack.pop)
+        if i == 0
+          visited << v
+          low[v] = ord[v] = now_ord
+          now_ord += 1
+        end
+
+        while i < @edges[v].size
+          u = @edges[v][i]
+          i += 1
+
+          if ord[u] == -1
+            stack << [v, i] << [u, 0]
+            break 1
+          end
+        end and next
+
+        low[v] = [low[v], @edges[v].map { |e| low[e] }.min || @n].min
+        next if low[v] != ord[v]
+
+        while (u = visited.pop)
+          low[u] = @n
+          ord[u] = group_num
           break if u == v
         end
         group_num += 1
-      end
-    }
-    @n.times { |i| dfs.(i) if ord[i] == -1 }
-    ids = ids.map { |x| group_num - 1 - x }
-    [group_num, ids]
-  end
 
-  def csr
-    start = [0] * (@n + 1)
-    elist = [nil] * @edges.size
-    @edges.each { |(i, _)| start[i + 1] += 1 }
-    @n.times { |i| start[i + 1] += start[i] }
-    counter = start.dup
-    @edges.each do |(i, j)|
-      elist[counter[i]] = j
-      counter[i] += 1
+      end
     end
-    [start, elist]
+
+    ord.map! { |e| group_num - e - 1 }
+    [group_num, ord]
   end
 end

data/lib_lock/ac-library-rb/scc.rb

@@ -4,7 +4,7 @@ module AcLibraryRb
     # initialize graph with n vertices
     def initialize(n)
       @n = n
-      @edges = []
+      @edges = Array.new(n) { [] }
     end
 
     # add directed edge
@@ -14,7 +14,7 @@ module AcLibraryRb
         raise ArgumentError.new(msg)
       end
 
-      @edges << [from, to]
+      @edges[from] << to
       self
     end
 
@@ -29,7 +29,7 @@ module AcLibraryRb
 
     # returns list of strongly connected components
     # the components are sorted in topological order
-    # O(@n + @edges.size)
+    # O(@n + @edges.sum(&:size))
     def scc
       group_num, ids = scc_ids
       groups = Array.new(group_num) { [] }
@@ -40,48 +40,50 @@ module AcLibraryRb
     private
 
     def scc_ids
-      start, elist = csr
-      now_ord = group_num = 0
-      visited, low, ord, ids = [], [], [-1] * @n, []
-      dfs = ->(v) {
-        low[v] = ord[v] = now_ord
-        now_ord += 1
-        visited << v
-        (start[v]...start[v + 1]).each do |i|
-          to = elist[i]
-          low[v] = if ord[to] == -1
-                     dfs.(to)
-                     [low[v], low[to]].min
-                   else
-                     [low[v], ord[to]].min
-                   end
-        end
-        if low[v] == ord[v]
-          loop do
-            u = visited.pop
-            ord[u] = @n
-            ids[u] = group_num
+      now_ord = 0
+
+      visited = []
+      low = Array.new(@n, 1 << 60)
+      ord = Array.new(@n, -1)
+      group_num = 0
+
+      (0...@n).each do |v|
+        next if ord[v] != -1
+
+        stack = [[v, 0]]
+
+        while (v, i = stack.pop)
+          if i == 0
+            visited << v
+            low[v] = ord[v] = now_ord
+            now_ord += 1
+          end
+
+          while i < @edges[v].size
+            u = @edges[v][i]
+            i += 1
+
+            if ord[u] == -1
+              stack << [v, i] << [u, 0]
+              break 1
+            end
+          end and next
+
+          low[v] = [low[v], @edges[v].map { |e| low[e] }.min || @n].min
+          next if low[v] != ord[v]
+
+          while (u = visited.pop)
+            low[u] = @n
+            ord[u] = group_num
             break if u == v
           end
           group_num += 1
-        end
-      }
-      @n.times { |i| dfs.(i) if ord[i] == -1 }
-      ids = ids.map { |x| group_num - 1 - x }
-      [group_num, ids]
-    end
 
-    def csr
-      start = [0] * (@n + 1)
-      elist = [nil] * @edges.size
-      @edges.each { |(i, _)| start[i + 1] += 1 }
-      @n.times { |i| start[i + 1] += start[i] }
-      counter = start.dup
-      @edges.each do |(i, j)|
-        elist[counter[i]] = j
-        counter[i] += 1
+        end
       end
-      [start, elist]
+
+      ord.map! { |e| group_num - e - 1 }
+      [group_num, ord]
     end
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ac-library-rb
 version: !ruby/object:Gem::Version
-  version: 0.7.0
+  version: 1.0.0
 platform: ruby
 authors:
 - universato
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2022-11-26 00:00:00.000000000 Z
+date: 2023-03-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: prime