summaryrefslogtreecommitdiff
path: root/test
diff options
context:
space:
mode:
authorHiroshi SHIBATA <hsbt@ruby-lang.org>2026-01-08 15:43:28 +0900
committerHiroshi SHIBATA <hsbt@ruby-lang.org>2026-01-08 18:48:00 +0900
commit9580c7d07bb048386f75be994ea33d2870d2e177 (patch)
treebcf9ed45e82647414cc31b1b961a0f5d00596df5 /test
parent946b1c1ba19e708d54a3f9eee00d4ea06434876c (diff)
Migrate tsort as bundled gems
Diffstat (limited to 'test')
-rw-r--r--test/test_tsort.rb115
1 files changed, 0 insertions, 115 deletions
diff --git a/test/test_tsort.rb b/test/test_tsort.rb
deleted file mode 100644
index 354d928908..0000000000
--- a/test/test_tsort.rb
+++ /dev/null
@@ -1,115 +0,0 @@
-# frozen_string_literal: true
-
-require 'tsort'
-require 'test/unit'
-
-class TSortHash < Hash # :nodoc:
- include TSort
- alias tsort_each_node each_key
- def tsort_each_child(node, &block)
- fetch(node).each(&block)
- end
-end
-
-class TSortArray < Array # :nodoc:
- include TSort
- alias tsort_each_node each_index
- def tsort_each_child(node, &block)
- fetch(node).each(&block)
- end
-end
-
-class TSortTest < Test::Unit::TestCase # :nodoc:
- def test_dag
- h = TSortHash[{1=>[2, 3], 2=>[3], 3=>[]}]
- assert_equal([3, 2, 1], h.tsort)
- assert_equal([[3], [2], [1]], h.strongly_connected_components)
- end
-
- def test_cycle
- h = TSortHash[{1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}]
- assert_equal([[4], [2, 3], [1]],
- h.strongly_connected_components.map {|nodes| nodes.sort})
- assert_raise(TSort::Cyclic) { h.tsort }
- end
-
- def test_array
- a = TSortArray[[1], [0], [0], [2]]
- assert_equal([[0, 1], [2], [3]],
- a.strongly_connected_components.map {|nodes| nodes.sort})
-
- a = TSortArray[[], [0]]
- assert_equal([[0], [1]],
- a.strongly_connected_components.map {|nodes| nodes.sort})
- end
-
- def test_s_tsort
- g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
- each_node = lambda {|&b| g.each_key(&b) }
- each_child = lambda {|n, &b| g[n].each(&b) }
- assert_equal([4, 2, 3, 1], TSort.tsort(each_node, each_child))
- g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
- assert_raise(TSort::Cyclic) { TSort.tsort(each_node, each_child) }
- end
-
- def test_s_tsort_each
- g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
- each_node = lambda {|&b| g.each_key(&b) }
- each_child = lambda {|n, &b| g[n].each(&b) }
- r = []
- TSort.tsort_each(each_node, each_child) {|n| r << n }
- assert_equal([4, 2, 3, 1], r)
-
- r = TSort.tsort_each(each_node, each_child).map {|n| n.to_s }
- assert_equal(['4', '2', '3', '1'], r)
- end
-
- def test_s_strongly_connected_components
- g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
- each_node = lambda {|&b| g.each_key(&b) }
- each_child = lambda {|n, &b| g[n].each(&b) }
- assert_equal([[4], [2], [3], [1]],
- TSort.strongly_connected_components(each_node, each_child))
- g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
- assert_equal([[4], [2, 3], [1]],
- TSort.strongly_connected_components(each_node, each_child))
- end
-
- def test_s_each_strongly_connected_component
- g = {1=>[2, 3], 2=>[4], 3=>[2, 4], 4=>[]}
- each_node = lambda {|&b| g.each_key(&b) }
- each_child = lambda {|n, &b| g[n].each(&b) }
- r = []
- TSort.each_strongly_connected_component(each_node, each_child) {|scc|
- r << scc
- }
- assert_equal([[4], [2], [3], [1]], r)
- g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
- r = []
- TSort.each_strongly_connected_component(each_node, each_child) {|scc|
- r << scc
- }
- assert_equal([[4], [2, 3], [1]], r)
-
- r = TSort.each_strongly_connected_component(each_node, each_child).map {|scc|
- scc.map(&:to_s)
- }
- assert_equal([['4'], ['2', '3'], ['1']], r)
- end
-
- def test_s_each_strongly_connected_component_from
- g = {1=>[2], 2=>[3, 4], 3=>[2], 4=>[]}
- each_child = lambda {|n, &b| g[n].each(&b) }
- r = []
- TSort.each_strongly_connected_component_from(1, each_child) {|scc|
- r << scc
- }
- assert_equal([[4], [2, 3], [1]], r)
-
- r = TSort.each_strongly_connected_component_from(1, each_child).map {|scc|
- scc.map(&:to_s)
- }
- assert_equal([['4'], ['2', '3'], ['1']], r)
- end
-end
-