Sha256: 7246654ca834e7425ef400132dedfbb7049a5ef09a422faed8a42843dc5827f8
Contents?: true
Size: 1.32 KB
Versions: 3
Compression:
Stored size: 1.32 KB
Contents
require 'test/unit' require 'rgl/traversal' require 'rgl/connected_components' require 'rgl/adjacency' require 'test_helper' include RGL def graph_from_string(s) g = DirectedAdjacencyGraph.new(Array) s.split(/\n/).collect{|x| x.split(/->/)}.each do |a| from = a[0].strip a[1].split.each do |to| g.add_edge from,to end end g end class TestComponents < Test::Unit::TestCase def setup @dg = DirectedAdjacencyGraph.new(Array) edges = [[1,2],[2,3],[2,4],[4,5],[1,6],[6,4]] edges.each do |(src,target)| @dg.add_edge(src, target) end @bfs = @dg.bfs_iterator(1) @dfs = @dg.dfs_iterator(1) @ug = AdjacencyGraph.new(Array) @ug.add_edges(*edges) @dg2 = graph_from_string( "a -> b f h b -> c a c -> d b d -> e e -> d f -> g g -> f d h -> i i -> h j e c") end def test_connected_components ccs = [] @ug.each_connected_component { |c| ccs << c } assert_equal(1,ccs.size) ccs = [] @ug.add_edge 10,11 @ug.add_edge 33,44 @ug.each_connected_component { |c| ccs << c.sort } assert_equal([[10, 11], [1, 2, 3, 4, 5, 6], [33,44]].sort,ccs.sort) end def test_strong_components vis = @dg2.strongly_connected_components assert_equal(4,vis.num_comp) assert_equal([["a", 3], ["b", 3], ["c", 3], ["d", 0], ["e", 0], ["f", 1], ["g", 1], ["h", 3], ["i", 3], ["j", 2]],vis.comp_map.to_a) end end
Version data entries
3 entries across 3 versions & 1 rubygems
Version | Path |
---|---|
rgl-0.3.0 | tests/TestComponents.rb |
rgl-0.4.0 | tests/TestComponents.rb |
rgl-0.3.1 | tests/TestComponents.rb |