igraph 0.1.1 → 0.3

data/test/tc_layout.rb

@@ -0,0 +1,26 @@
+require 'test/unit'
+require 'igraph'
+
+class TestGraph < Test::Unit::TestCase
+  def test_random
+    g = IGraph.new([1,2,3,4],true)
+    l = g.layout_random
+    assert_instance_of IGraphMatrix, l
+    assert_equal g.vcount, l.nrow
+    assert_equal 2,        l.ncol
+  end
+  def test_circle
+    g = IGraph.new([1,2,3,4],true)
+    l = g.layout_circle
+    assert_instance_of IGraphMatrix, l
+    assert_equal g.vcount, l.nrow
+    assert_equal 2,        l.ncol
+  end
+  def test_fruchterman_reingold
+    g = IGraph.new([1,2,3,4],true)
+    l = g.layout_fruchterman_reingold(10,1,1,2,1,false)
+    assert_instance_of IGraphMatrix, l
+    assert_equal g.vcount, l.nrow
+    assert_equal 2,        l.ncol
+  end
+end

data/test/tc_matrix.rb

@@ -0,0 +1,32 @@
+require 'test/unit'
+require 'igraph'
+
+class TestGraph < Test::Unit::TestCase
+  def test_matrix
+    m = IGraphMatrix.new([1,2],[3,4])
+    assert_equal 1, m[0,0]
+    assert_equal 3, m[1,0]
+  end
+  def test_set
+    m = IGraphMatrix.new([1,2],[3,4])
+    m[0,0] = 6
+    assert_equal 6, m[0,0]
+  end
+  def test_prop
+    m = IGraphMatrix.new([1,2],[3,4])
+    assert_equal 4, m.size
+    assert_equal 2, m.nrow
+    assert_equal 2, m.ncol
+    assert_equal 4, m.max
+  end
+  def test_op
+    m = IGraphMatrix.new([1,2],[3,4])
+    n = m * 2
+    assert_equal 1, m[0,0]
+    assert_equal 2, n[0,0]
+  end
+  def test_to_a
+    m = IGraphMatrix.new([1,2],[3,4])
+    assert_equal [[1,2],[3,4]], m.to_a
+  end
+end

data/test/tc_selectors.rb

@@ -11,4 +11,19 @@ class TestGraph < Test::Unit::TestCase
     graph = IGraph.new(['A','B','C','D'],true)
     assert_equal ['B'], graph.adjacent_vertices('A',IGraph::ALL)
   end
+  def test_non_adj
+    graph = IGraph.new(['A','B','C','D'],true)
+    assert_equal ['A','C','D'], graph.nonadjacent_vertices('A',IGraph::ALL)
+  end
+
+  def test_e_all
+    graph = IGraph.new(['A','B','C','D'],true)
+    assert_equal [0,1], graph.edges(IGraph::EDGEORDER_ID)
+  end
+
+  def test_e_adj
+    graph = IGraph.new(['A','B','C','D'],true,[1,2])
+    assert_equal [0], graph.adjacent_edges('B',IGraph::ALL)
+  end
+
 end

data/test/tc_shortest_paths.rb

@@ -13,9 +13,32 @@ class TestGraph < Test::Unit::TestCase
 
   def test_get_shortest_paths
     graph = IGraph.new(['A','B','C','D'],true)    
-    m = graph.get_shortest_paths('A',['B','C'],IGraph::ALL)
+    m = graph.get_shortest_paths('A',['B'],IGraph::ALL)
     assert_equal ['A','B'], m[0]
-    assert_equal [],        m[1]
+    #assert_equal [],        m[1]
+  end
+
+  def test_get_all_shortest_paths
+    graph = IGraph.new(['A','B','A','C','B','D','C','D'],true)    
+    m = graph.get_all_shortest_paths('A',['D'],IGraph::ALL)
+    assert_equal 2, m.length
+  end
+
+  def test_average_path_length
+    graph = IGraph.new(['A','B','A','C','B','D','C','D'],true)    
+    m = graph.average_path_length(true,true)
+    assert_equal 1.2, m
+  end
+
+  def test_diameter_girth
+    graph = IGraph.new(['A','B','A','C','B','D'],true)    
+    m = graph.diameter(true,true)
+    assert_equal 3, m.length
+    assert_raises IGraphError do 
+      graph.girth
+    end
+    graph = IGraph.new(['A','B','A','C','B','D','C','D'],true)    
+    assert_equal 4, graph.girth.length
   end
 
 end

data/test/tc_topological_sort.rb

@@ -0,0 +1,10 @@
+require 'test/unit'
+require 'igraph'
+
+class TestGraph < Test::Unit::TestCase
+  def test_top_sort
+    g = IGraph.new([1,2,2,3,3,4])
+    assert_equal [1,2,3,4], g.topological_sorting(IGraph::OUT)
+  end
+  
+end

data/test/tc_vertex_neighbourhood.rb

@@ -0,0 +1,29 @@
+require 'test/unit'
+require 'igraph'
+
+class TestGraph < Test::Unit::TestCase
+  def test_neighbourhood_size
+    graph = IGraph.new(['A','B','C','D'],true)
+    assert_equal [1], graph.neighbourhood_size(['A'],0,IGraph::ALL)
+    assert_equal [2], graph.neighbourhood_size(['A'],1,IGraph::ALL)
+  end
+  def test_neighbourhood
+    graph = IGraph.new(['A','B','B','C','C','D'],true) 
+    assert_equal [['A']],         graph.neighborhood(['A'],0,IGraph::ALL)
+    assert_equal [['A','B']],     graph.neighborhood(['A'],1,IGraph::ALL)
+    assert_equal [['A','B','C']], graph.neighborhood(['A'],2,IGraph::ALL)
+  end
+  def test_neighborhood_graph
+    graph = IGraph.new(['A','B','B','C','C','D'],true,[1,2,3]) 
+    assert_instance_of IGraph, graph.neighbourhood_graphs(['A'],0,IGraph::ALL)[0]
+    assert_equal ['A'], 
+    graph.neighbourhood_graphs(['A'],0,IGraph::ALL)[0].to_a
+    assert_equal ['A','B'],
+    graph.neighbourhood_graphs(['A'],1,IGraph::ALL)[0].to_a
+    assert_equal 1, graph.neighbourhood_graphs(['A'],1,IGraph::ALL)[0]['A','B']
+    assert_equal ['A','B','C'], 
+    graph.neighbourhood_graphs(['A'],2,IGraph::ALL)[0].to_a
+    assert_equal 2, graph.neighbourhood_graphs(['A'],2,IGraph::ALL)[0]['B','C']
+    
+  end
+end

data/test/test_all.rb

@@ -2,11 +2,20 @@
 
 require 'test/unit'
 
+require 'tc_attributes'
 require 'tc_create'
 require 'tc_iterators'
 require 'tc_selectors'
 require 'tc_add_delete'
 require 'tc_basic_query'
 require 'tc_basic_properties'
+require 'tc_centrality'
+require 'tc_components'
+require 'tc_copy'
 require 'tc_error_handling'
+require 'tc_file_read_write'
+require 'tc_layout'
+require 'tc_matrix'
 require 'tc_shortest_paths'
+require 'tc_topological_sort'
+require 'tc_vertex_neighbourhood'

metadata

@@ -3,15 +3,15 @@ rubygems_version: 0.9.2
 specification_version: 1
 name: igraph
 version: !ruby/object:Gem::Version 
-  version: 0.1.1
-date: 2007-07-05 00:00:00 +09:00
-summary: IGraph
+  version: "0.3"
+date: 2007-08-16 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
 email: alexg@kuicr.kyoto-u.ac.jp
 homepage: http://igraph.rubyforge.org/
 rubyforge_project: igraph
-description: IGraph
+description: 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.
 autorequire: 
 default_executable: 
 bindir: bin
@@ -36,22 +36,39 @@ files:
 - ext/cIGraph.c
 - ext/cIGraph.h
 - ext/cIGraph_add_delete.c
+- ext/cIGraph_attribute_handler.c
 - ext/cIGraph_basic_properties.c
 - ext/cIGraph_basic_query.c
+- ext/cIGraph_centrality.c
+- ext/cIGraph_components.c
 - ext/cIGraph_error_handlers.c
+- ext/cIGraph_file.c
 - ext/cIGraph_iterators.c
+- ext/cIGraph_layout.c
+- ext/cIGraph_matrix.c
 - ext/cIGraph_operators.c
 - ext/cIGraph_selectors.c
 - ext/cIGraph_shortest_paths.c
+- ext/cIGraph_topological_sort.c
 - ext/cIGraph_utility.c
+- ext/cIGraph_vertex_neighbourhood.c
 - test/tc_add_delete.rb
+- test/tc_attributes.rb
 - test/tc_basic_properties.rb
 - test/tc_basic_query.rb
+- test/tc_centrality.rb
+- test/tc_components.rb
+- test/tc_copy.rb
 - test/tc_create.rb
 - test/tc_error_handling.rb
+- test/tc_file_read_write.rb
 - test/tc_iterators.rb
+- test/tc_layout.rb
+- test/tc_matrix.rb
 - test/tc_selectors.rb
 - test/tc_shortest_paths.rb
+- test/tc_topological_sort.rb
+- test/tc_vertex_neighbourhood.rb
 - test/test_all.rb
 test_files: 
 - test/test_all.rb