igraph 0.3.3 → 0.9.0

data/test/tc_isomorphic.rb

@@ -27,7 +27,7 @@ class TestGraph < Test::Unit::TestCase
   end
   def test_igraph_isoclass_create
     g = IGraph.new([1,2,3,4],false)
-    h = IGraph.isoclass_create(4,g.isoclass,false)
+    h = IGraph::Generate.isoclass_create(4,g.isoclass,false)
     assert_equal g.isoclass, h.isoclass
   end
 end

data/test/tc_layout.rb

@@ -58,4 +58,14 @@ class TestGraph < Test::Unit::TestCase
     assert_equal g.vcount, l.nrow
     assert_equal 2,        l.ncol
   end
+  def test_merge
+    g = IGraph.new([1,2,3,4],true)
+    l = g.layout_lgl(10,1,1,2,1,1,1)
+    h = IGraph.new([1,2,3,4],true)
+    m = h.layout_lgl(10,1,1,2,1,1,1)
+    f = IGraph::Layout.layout_merge_dla([g,h],[l,m])
+    assert_instance_of IGraphMatrix, f
+    assert_equal g.vcount + h.vcount, f.nrow
+    assert_equal 2,                   f.ncol
+  end
 end

data/test/tc_layout3d.rb

@@ -0,0 +1,34 @@
+require 'test/unit'
+require 'igraph'
+
+class TestGraph < Test::Unit::TestCase
+  def test_random_3d
+    g = IGraph.new([1,2,3,4],true)
+    l = g.layout_random_3d
+    assert_instance_of IGraphMatrix, l
+    assert_equal g.vcount, l.nrow
+    assert_equal 3,        l.ncol
+  end
+  def test_sphere
+    g = IGraph.new([1,2,3,4],true)
+    l = g.layout_sphere
+    assert_instance_of IGraphMatrix, l
+    assert_equal g.vcount, l.nrow
+    assert_equal 3,        l.ncol
+  end
+  def test_fruchterman_reingold_3d
+    g = IGraph.new([1,2,3,4],true)
+    l = g.layout_fruchterman_reingold_3d(10,1,1,2,1)
+    assert_instance_of IGraphMatrix, l
+    assert_equal g.vcount, l.nrow
+    assert_equal 3,        l.ncol
+  end
+  def test_kamada_kawai_3d
+    g = IGraph.new([1,2,3,4],true)
+    l = g.layout_kamada_kawai_3d(10,1,1,2,1)
+    assert_instance_of IGraphMatrix, l
+    assert_equal g.vcount, l.nrow
+    assert_equal 3,        l.ncol
+  end  
+  
+end

data/test/tc_mincuts.rb

@@ -0,0 +1,20 @@
+require 'test/unit'
+require 'igraph'
+
+class TestGraph < Test::Unit::TestCase
+  def test_maxflow_mincut
+    g = IGraph.new([1,2,2,3,3,4])
+    assert_equal 3, g.maxflow_value(1,4,[5,4,3])
+    assert_equal 3, g.st_mincut_value(1,4,[5,4,3])
+  end
+  def test_mincut
+    g = IGraph.new([1,2,2,3,3,4,2,1,3,2,4,3],true)
+    assert_equal 3, g.mincut_value([5,4,3,3,4,5])
+    g = IGraph.new([1,2,2,3,1,3,3,4,4,5,4,6,5,6],false)
+    val,p1,p2,cut_eid = g.mincut(Array.new(7,1))
+    assert_equal 1,       val
+    assert_equal [1,2,3], p2.sort
+    assert_equal [4,5,6], p1.sort
+    assert_equal [3],       cut_eid
+  end
+end

data/test/tc_randomisation.rb

@@ -0,0 +1,15 @@
+require 'test/unit'
+require 'igraph'
+
+class TestGraph < Test::Unit::TestCase
+  def test_rewire_edges
+    g = IGraph::GenerateRandom.grg_game(10,0.1,false)
+    h = g.rewire_edges(0.5)
+    assert_equal 10, h.to_a.size
+  end
+  def test_rewire
+    g = IGraph::GenerateRandom.grg_game(10,0.1,false)
+    h = g.rewire(0.5)
+    assert_equal 10, h.to_a.size
+  end
+end

data/test/test_all.rb

@@ -9,21 +9,27 @@ require 'tc_add_delete'
 require 'tc_basic_query'
 require 'tc_basic_properties'
 require 'tc_centrality'
+require 'tc_community'
 require 'tc_components'
+require 'tc_connectivity'
 require 'tc_copy'
 require 'tc_cores'
 require 'tc_dijkstra'
 require 'tc_directedness'
 require 'tc_error_handling'
 require 'tc_file_read_write'
+require 'tc_generators_deterministic'
 require 'tc_generators_random'
 require 'tc_independent_vertex_sets'
 require 'tc_isomorphic'
 require 'tc_iterators'
 require 'tc_layout'
+require 'tc_layout3d'
 require 'tc_matrix'
+require 'tc_mincuts'
 require 'tc_motif'
 require 'tc_other_ops'
+require 'tc_randomisation'
 require 'tc_selectors'
 require 'tc_shortest_paths'
 require 'tc_spanning'

metadata

@@ -1,10 +1,10 @@
 --- !ruby/object:Gem::Specification 
-rubygems_version: 0.9.2
+rubygems_version: 0.9.4
 specification_version: 1
 name: igraph
 version: !ruby/object:Gem::Version 
-  version: 0.3.3
-date: 2007-10-02 00:00:00 +09:00
+  version: 0.9.0
+date: 2007-11-19 00:00:00 +09:00
 summary: IGraph is a Ruby extension for interfacing with the C igraph library (http://cneurocvs.rmki.kfki.hu/igraph/). igraph is a library for creating and manipulating graphs with a particular emphasis on network analysis functions.
 require_paths: 
 - test
@@ -42,21 +42,27 @@ files:
 - ext/cIGraph_basic_query.c
 - ext/cIGraph_centrality.c
 - ext/cIGraph_cliques.c
+- ext/cIGraph_community.c
 - ext/cIGraph_components.c
+- ext/cIGraph_connectivity.c
 - ext/cIGraph_dijkstra.c
 - ext/cIGraph_direction.c
 - ext/cIGraph_error_handlers.c
 - ext/cIGraph_file.c
+- ext/cIGraph_generators_deterministic.c
 - ext/cIGraph_generators_random.c
 - ext/cIGraph_independent_vertex_sets.c
 - ext/cIGraph_isomorphism.c
 - ext/cIGraph_iterators.c
 - ext/cIGraph_kcores.c
 - ext/cIGraph_layout.c
+- ext/cIGraph_layout3d.c
 - ext/cIGraph_matrix.c
+- ext/cIGraph_min_cuts.c
 - ext/cIGraph_motif.c
 - ext/cIGraph_operators.c
 - ext/cIGraph_other_ops.c
+- ext/cIGraph_randomisation.c
 - ext/cIGraph_selectors.c
 - ext/cIGraph_shortest_paths.c
 - ext/cIGraph_spanning.c
@@ -73,7 +79,9 @@ files:
 - test/tc_basic_query.rb
 - test/tc_centrality.rb
 - test/tc_cliques.rb
+- test/tc_community.rb
 - test/tc_components.rb
+- test/tc_connectivity.rb
 - test/tc_copy.rb
 - test/tc_cores.rb
 - test/tc_create.rb
@@ -81,14 +89,18 @@ files:
 - test/tc_directedness.rb
 - test/tc_error_handling.rb
 - test/tc_file_read_write.rb
+- test/tc_generators_deterministic.rb
 - test/tc_generators_random.rb
 - test/tc_independent_vertex_sets.rb
 - test/tc_isomorphic.rb
 - test/tc_iterators.rb
 - test/tc_layout.rb
+- test/tc_layout3d.rb
 - test/tc_matrix.rb
+- test/tc_mincuts.rb
 - test/tc_motif.rb
 - test/tc_other_ops.rb
+- test/tc_randomisation.rb
 - test/tc_selectors.rb
 - test/tc_shortest_paths.rb
 - test/tc_spanning.rb
@@ -98,7 +110,6 @@ files:
 - test/tc_transitivity.rb
 - test/tc_vertex_neighbourhood.rb
 - test/test_all.rb
-- test/test_draw.rb
 test_files: 
 - test/test_all.rb
 rdoc_options: 

data/test/test_draw.rb

@@ -1,61 +0,0 @@
-require 'igraph'
-require 'cairo'
-
-g = IGraph.barabasi_game(100,3,false,false)
-
-vertices = g.to_a
-layout   = g.send(ARGV.shift.to_sym,*ARGV.map{|a| eval(a)}).to_a
-
-format = Cairo::FORMAT_ARGB32
-width = 1000
-height = 1000
-
-surface = Cairo::ImageSurface.new(format, width, height)
-cr = Cairo::Context.new(surface)
-
-# fill background with white
-cr.set_source_rgba(1.0, 1.0, 1.0, 0.8)
-cr.paint
-
-max_x = layout.map{|a| a[0]}.max
-min_x = layout.map{|a| a[0]}.min
-max_y = layout.map{|a| a[1]}.max
-min_y = layout.map{|a| a[1]}.min
-
-x_var = max_x - min_x
-y_var = max_y - min_y
-
-max_var = [x_var,y_var].max
-
-layout.each_with_index do |a,i|
-  x,y = *a
-
-  x = (x - min_x)/max_var
-  y = (y - min_y)/max_var
-  x *= (width)
-  y *= (height)
-
-  layout[i] = [x,y]
-
-  puts "#{x} #{y}"
-
-end
-
-layout.each_with_index do |a,i|
-
-  v = vertices[i]
-  x,y = *a
-
-  cr.set_source_rgba(rand,rand,rand,0.5)
-  cr.circle(x,y,1).fill
-
-  g.adjacent_vertices(v,IGraph::OUT).each do |w|
-    cr.move_to(x,y)
-    wx,wy = *layout[vertices.index(w)]
-    cr.line_to(wx,wy)
-    cr.stroke
-  end
-
-end
-
-cr.target.write_to_png("test.png")