relax4 1.0.3 → 1.0.4

data/README.rdoc

@@ -1,4 +1,4 @@
-= relax4_ruby
+= relax4
 
 http://relax4.rubyforge.org
 
@@ -70,11 +70,11 @@ A lower-level interface is also available; see the docs for the Relax4 module.
 Has been tested on:
 * x86-linux (Ubuntu 10.04) with Ruby 1.8.7p249
 * x86-linux (Ubuntu 10.04) with Ruby 1.9.1p378
-* x86_64-linux (CentOS) with Ruby 1.8.7-p72
+* x86_64-linux (CentOS) with Ruby 1.8.7p72
 
 The following packages were required to install on Ubuntu 10.04:
 
-* ruby, ruby-dev, rubygems, rake
+* ruby, ruby-dev, rubygems
 
 The bindings were generated with f2c (FORTRAN to C converter) and SWIG
 (www.swig.org), but you don't need either to build the gem.

data/ext/relax4.c

@@ -2,7 +2,14 @@
  * This file was translated by f2c (FORTRAN to C) (version 20090411) from
  * relax4.f (see http://www.netlib.org/f2c).
  *
- * It has been modified (JLM) for use as a library (see relax4.h).
+ * It has been modified (JLM) for use as a library (see relax4.h for interface).
+ * The main changes are:
+ *
+ * 1) Now using dynamic (malloc'd) rather than static arrays.
+ * 2) An apparent bug in ascnt2_ has been fixed: the prdcsr array is a
+ * node-length array, but it was indexed by the 'nb' variable, which can become
+ * larger than the number of nodes. A new arc-length array (temp_nb) has been
+ * added to avoid this.
  *
  * The f2c linkage dependencies have been removed, but the FORTRAN character of
  * the code has been largely preserved -- you have been warned.
@@ -315,6 +322,10 @@ struct {
 
 #define cr_1 cr_
 
+/* Temporary added by JLM to avoid out-of-bounds problem caused by using the
+ * prdcsr array in ascnt2_. */
+RELAX4_INT *temp_nb;
+
 /* Subroutine */ int inidat_(void)
 {
   /* System generated locals */
@@ -3659,7 +3670,7 @@ L4:
         if (arrayrc_1.rc[arc - 1] == 0) {
           *delx += arrayu_1.u[arc - 1];
           ++nb;
-          blk2_3.prdcsr[nb - 1] = arc;
+          temp_nb[nb - 1] = arc; /* was blk2_3.prdcsr */
         }
       }
       /* L6: */
@@ -3694,7 +3705,7 @@ L4:
 
   i__1 = nb;
   for (i__ = 1; i__ <= i__1; ++i__) {
-    arc = blk2_3.prdcsr[i__ - 1];
+    arc = temp_nb[i__ - 1]; /* was blk2_3.prdcsr */
     if (blk13_1.tnxtin[arc - 1] == -1) {
       j = arraye_1.endn[arc - 1];
       blk13_1.tnxtin[arc - 1] = blk12_1.tfstin[j - 1];
@@ -3797,6 +3808,7 @@ int relax4_init(RELAX4_INT num_nodes, RELAX4_INT num_arcs,
   blk15_1.i15 = NULL;
   blk16_1.i16 = NULL;
   blk17_1.i17 = NULL;
+  temp_nb = NULL;
 
   arrayrc_1.rc   = malloc(num_arcs*sizeof(RELAX4_INT));
   blk1_1.i1      = malloc(num_nodes*sizeof(RELAX4_INT));
@@ -3816,6 +3828,7 @@ int relax4_init(RELAX4_INT num_nodes, RELAX4_INT num_arcs,
   blk15_1.i15    = malloc(num_nodes*sizeof(RELAX4_INT));
   blk16_1.i16    = malloc(num_nodes*sizeof(RELAX4_INT));
   blk17_1.i17    = malloc(num_nodes*sizeof(RELAX4_INT));
+  temp_nb        = malloc(num_arcs*sizeof(RELAX4_INT));
 
   if (arrayrc_1.rc == NULL ||
       blk1_1.i1 == NULL ||
@@ -3834,7 +3847,8 @@ int relax4_init(RELAX4_INT num_nodes, RELAX4_INT num_arcs,
       blk14_1.i14 == NULL ||
       blk15_1.i15 == NULL ||
       blk16_1.i16 == NULL ||
-      blk17_1.i17 == NULL) {
+      blk17_1.i17 == NULL ||
+      temp_nb == NULL) {
     relax4_free();
     return RELAX4_FAIL_OUT_OF_MEMORY;
   }
@@ -3948,5 +3962,6 @@ void relax4_free()
   if(blk15_1.i15   ) free(blk15_1.i15   );
   if(blk16_1.i16   ) free(blk16_1.i16   );
   if(blk17_1.i17   ) free(blk17_1.i17   );
+  if(temp_nb       ) free(temp_nb       );
 }
 

data/lib/relax4/version.rb

@@ -1,3 +1,3 @@
 module Relax4
-  VERSION = '1.0.3'
+  VERSION = '1.0.4'
 end

data/test/RELAX4.INP

@@ -0,0 +1,101 @@
+      20      80
+       1      10      -4     215
+       1      16      -8     138
+       8      18       2     215
+       8      14      -5      76
+       8      20      -6     193
+      10       8      -9     215
+      10      16      -4     215
+      10       6       9     190
+      10      20      -8     141
+      10       4      -5     152
+      10      11       2      63
+       2      15       5     266
+       2       4      -5     186
+       2       6      -3     162
+       2      17       7      84
+       2      11       6      94
+       2      18      -6     113
+      12      18      -6     266
+      12       7       9     106
+      12       9       4     143
+      12      17       7      95
+      12      15       7     181
+      12       4       9     104
+      12      20      -9      84
+      15      12       8     266
+      15      16      -4     266
+      15      17       5     154
+      15      20       3     132
+      15       4       2     164
+       3       6       2      50
+       3      18      -7     131
+       3      19      -8      89
+       6       7      -2      50
+       6      19      -6     102
+       6       9       6      56
+       7       9      -7      50
+       7       6       3     129
+       7       5      -7     141
+       9      19      -1      50
+       9      17      -2      50
+       9      18       4      50
+       9      13      -7     162
+       9      16      -2     121
+       9      11      10     115
+       9      10      -3     166
+       9       4       1     111
+       4      13     -10     195
+       4      19       8     112
+       4      16       2     195
+       4      10      -9     143
+       4       9     -10     135
+       4      14      -4     191
+      13      18      -9     195
+      13      19     -10     195
+      13       8      -8     165
+      13      17       0     132
+       5      11      -8     319
+       5       7      -8      70
+       5      20       0      63
+       5       9      -9     194
+      11      14      -3     319
+      11      19       2     125
+      11      12      -9     177
+      14      20      -7     319
+      14      16       7     319
+      14       8       9     174
+      14      11      10      77
+      14       5      -4     123
+      14      18       5     125
+      14      12     -10      69
+      16      19      -3     128
+      16      10      -4      56
+      16       6       0     145
+      16      17      10     104
+      16      12       2     199
+      16       5      -5     159
+      17       7       2      68
+      17      12      -3      57
+      17      18      -3     113
+      17      11      -2     130
+     215
+     266
+       5
+     195
+     319
+       0
+       0
+       0
+       0
+       0
+       0
+       0
+       0
+       0
+       0
+    -386
+      -1
+    -399
+     -54
+    -160

data/test/test_relax4.rb

@@ -0,0 +1,284 @@
+require "test/unit"
+require "relax4"
+
+class TestRelax4< Test::Unit::TestCase
+  def test_solve_1
+    # From Figure 7.14 of Bertsimas and Tsitsiklis (1997). Introduction to
+    # Linear Optimization.
+    prob = {
+      :demands     => [-1, 0, 0, 0, 1],
+      :start_nodes => [ 1, 1, 2, 3, 4, 4],
+      :end_nodes   => [ 2, 3, 4, 5, 3, 5],
+      :costs       => [ 0, 1, 0, 0, 0, 1]}
+    soln =            [ 1, 0, 1, 1, 1, 0]
+    assert_equal soln, Relax4.solve(prob)
+    assert_equal soln, Relax4.solve(prob.merge(:auction_init => true))
+  end
+
+  def test_solve_2
+    # From Figure 29.3 of Cormen, Leiserson, Rivest and Stein (2001).
+    # Introduction to Algorithms, 2nd Edition.
+    prob = {
+      :demands     => [-4, 0, 0, 4],
+      :start_nodes => [ 1, 1, 2, 2, 3],
+      :end_nodes   => [ 2, 3, 3, 4, 4],
+      :costs       => [ 2, 5, 3, 7, 1],
+      :capacities  => [ 5, 2, 1, 2, 4]}
+    soln =            [ 2, 2, 1, 1, 3]
+    flows = Relax4.solve(prob)
+    assert_equal soln, flows
+    assert_equal 27, problem_cost(prob, flows)
+
+    assert_equal soln, Relax4.solve(prob.merge(:auction_init => true))
+  end
+
+  # Load problem from relax4_input format.
+  # Note that the input format has node surpluses rather than demands.
+  # No error checking.
+  def problem_from_relax4_inp file_name
+    require 'scanf'
+    File.open(file_name) {|f|
+      num_nodes, num_arcs = f.scanf('%d %d')
+      arcs = num_arcs.times.collect {f.scanf('%d %d %d %d')}
+      demands = num_nodes.times.collect {-f.scanf('%d').first}
+      {
+        :demands     => demands,
+        :start_nodes => arcs.map{|x| x[0].to_i},
+        :end_nodes   => arcs.map{|x| x[1].to_i},
+        :costs       => arcs.map{|x| x[2].to_i},
+        :capacities  => arcs.map{|x| x[3].to_i}
+      }
+    }
+  end
+
+  # Compute cost of flows.
+  def problem_cost prob, flows
+    flows.zip(prob[:costs]).map{|f,c|f*c}.inject(:+)
+  end
+
+  def test_solve_3
+    prob = problem_from_relax4_inp 'test/RELAX4.INP'
+
+    flows = Relax4.solve(prob)
+    assert_equal(-26464, problem_cost(prob, flows))
+
+    flows = Relax4.solve(prob.merge(:auction_init => true))
+    assert_equal(-26464, problem_cost(prob, flows))
+  end
+
+  def test_solve_4
+    # This problem appears to fail due to overflow. Its arc capacities are set
+    # to 500 million (equal to the default LARGE constant), and this causes the
+    # solver to incorrectly report that the problem is infeasible. Reducing the
+    # capacities by a factor of 10 makes it work OK.
+    #
+    # Note that giving this file to the original application works, because it
+    # only reads the first 8 digits of any input number (format I8) -- i.e. it
+    # sets the capacities to 50M not 500M. 
+    prob = problem_from_relax4_inp 'test/test_solve_4.inp'
+    prob[:capacities].map! {|x| [x, Relax4::RELAX4_UNCAPACITATED].min}
+    flows = Relax4.solve(prob)
+    assert_equal 1381, problem_cost(prob, flows)
+  end
+
+  def test_solve_5
+    # This problem caused either a memory error or an infinite loop due to an
+    # apparent bug in the ascnt2_ routine (out of bounds on the prdcsr array,
+    # which was not long enough to record the number of newly balanced arcs).
+    # This bug affected versions 1.0.3 and earlier.
+    prob = problem_from_relax4_inp 'test/test_solve_5.inp'
+    prob[:capacities].map! {|x| [x, Relax4::RELAX4_UNCAPACITATED].min}
+    flows = Relax4.solve(prob)
+    assert_equal 28759, problem_cost(prob, flows)
+  end
+
+  def test_solve_lemon_1
+    # Some tests stolen from LEMON version 1.2 (test/min_cost_flow_test.cc).
+    # Note that we can't handle minimum flows, so we can only run tests with the
+    # 'low1' series.
+    nodes_text = <<NODES.lines.drop(1).join("\n")
+label  sup1 sup2 sup3 sup4 sup5 sup6
+    1    20   27    0   30   20   30
+    2    -4    0    0    0   -8   -3
+    3     0    0    0    0    0    0
+    4     0    0    0    0    0    0
+    5     9    0    0    0    6   11
+    6    -6    0    0    0   -5   -6
+    7     0    0    0    0    0    0
+    8     0    0    0    0    0    3
+    9     3    0    0    0    0    0
+   10    -2    0    0    0   -7   -2
+   11     0    0    0    0  -10    0
+   12   -20  -27    0  -30  -30  -20
+NODES
+    node_rx = /^\s*\d#{'+\s+(-?\d+)'*6}\s*$/
+    demands = (0...6).map{|i| nodes_text.scan(node_rx).map{|x| -x[i].to_i}}
+
+    arcs_text = <<ARCS.lines.drop(1).join("\n")
+       cost  cap 
+ 1  2    70   11 
+ 1  3   150    3 
+ 1  4    80   15 
+ 2  8    80   12 
+ 3  5   140    5 
+ 4  6    60   10 
+ 4  7    80    2 
+ 4  8   110    3 
+ 5  7    60   14 
+ 5 11   120   12 
+ 6  3     0    3 
+ 6  9   140    4 
+ 6 10    90    8 
+ 7  1    30    5 
+ 8 12    60   16 
+ 9 12    50    6 
+10 12    70   13 
+10  2   100    7 
+10  7    60   10 
+11 10    20   14 
+12 11    30   10 
+ARCS
+
+    arc_rx = /^\s*(\d+)\s+(\d+)\s+(-?\d+)\s+(\d+)\s*$/
+    prob = {
+      :start_nodes => arcs_text.scan(arc_rx).map{|x| x[0].to_i},
+      :end_nodes   => arcs_text.scan(arc_rx).map{|x| x[1].to_i},
+      :costs       => arcs_text.scan(arc_rx).map{|x| x[2].to_i},
+      :capacities  => arcs_text.scan(arc_rx).map{|x| x[3].to_i}}
+
+    # l1, s1
+    flows = Relax4.solve(prob.merge(:demands => demands[0]))
+    assert_equal 5240, problem_cost(prob, flows)
+
+    # l1, s2
+    flows = Relax4.solve(prob.merge(:demands => demands[1]))
+    assert_equal 7620, problem_cost(prob, flows)
+
+    # l1, s5 is infeasible because s5 doesn't have balanced supply and demand
+    assert_raise Relax4::InfeasibleError do
+      Relax4.solve(prob.merge(:demands => demands[4]))
+    end
+
+    # unit costs and no capacities (corresponding to "cc" and "cu")
+    prob_unit = {
+      :start_nodes => arcs_text.scan(arc_rx).map{|x| x[0].to_i},
+      :end_nodes   => arcs_text.scan(arc_rx).map{|x| x[1].to_i},
+      :costs       => [1]*21}
+
+    # l1, s1
+    flows = Relax4.solve(prob_unit.merge(:demands => demands[0]))
+    assert_equal 74, problem_cost(prob_unit, flows)
+
+    # l1, s3
+    flows = Relax4.solve(prob_unit.merge(:demands => demands[2]))
+    assert_equal 0, problem_cost(prob_unit, flows)
+  end
+
+  def test_solve_lemon_2
+    # From test_neg1_lgf in test/min_cost_flow_test.cc. This contains a negative
+    # cost cycle (5, 6, 7). The result is that edges in the cycle are at
+    # capacity; if capacities are not specified, they go to the
+    # RELAX4_UNCAPACITATED constant.
+    prob = {
+      :demands     => [-100, 0, 0, 100, 0, 0, 0],
+      :start_nodes => [  1, 1, 2, 3, 3, 5, 5, 6,   7],
+      :end_nodes   => [  2, 3, 4, 4, 2, 3, 6, 7,   5],
+      :costs       => [100,30,20,80,50,10,80,30,-120],
+    }
+
+    flows = Relax4.solve(prob)
+    big = Relax4::RELAX4_UNCAPACITATED
+    assert_equal [0,100,100,0,100,0,big,big,big], flows
+
+    flows = Relax4.solve(prob.merge(:auction_init => true))
+    assert_equal [0,100,100,0,100,0,big,big,big], flows
+
+    # If we put capacity bounds on, we get less flow around the -ve cost cycle.
+    flows = Relax4.solve(prob.merge(:capacities=>[5000]*9))
+    assert_equal(-40000, problem_cost(prob, flows))
+
+    # If we put capacity bounds on, we get less flow around the -ve cost cycle.
+    flows = Relax4.solve(prob.merge(:capacities=>[5000]*9, :auction_init=>true))
+    assert_equal(-40000, problem_cost(prob, flows))
+  end
+
+  def test_bad_args_1
+    # Empty problem is invalid.
+    assert_raise ArgumentError do
+      Relax4.solve(:start_nodes => [], 
+                   :end_nodes   => [],
+                   :costs       => [],
+                   :demands     => [])
+    end
+
+    # Mismatch in array lengths.
+    assert_raise ArgumentError do
+      Relax4.solve(:start_nodes => [1,2], 
+                   :end_nodes   => [2,1],
+                   :costs       => [1,1,1], # too many
+                   :demands     => [-1,1])
+    end
+
+    # Node out of range.
+    assert_raise ArgumentError do
+      Relax4.solve(:start_nodes => [1,3], # bad node: 3
+                   :end_nodes   => [2,1],
+                   :costs       => [1,1],
+                   :demands     => [-1,1])
+    end
+    assert_raise ArgumentError do
+      Relax4.solve(:start_nodes => [1,2], 
+                   :end_nodes   => [2,3], # bad node: 3 
+                   :costs       => [1,1],
+                   :demands     => [-1,1])
+    end
+
+    # Cost out of range.
+    assert_raise ArgumentError do
+      Relax4.solve(:start_nodes => [1,2],
+                   :end_nodes   => [2,1],
+                   :costs       => [99,101], # bad cost: 100
+                   :demands     => [-1,1],
+                   :large       => 1000,
+                   :max_cost    => 100)
+    end
+
+    # Capacity out of range.
+    assert_raise ArgumentError do
+      Relax4.solve(:start_nodes => [1,2],
+                   :end_nodes   => [2,1],
+                   :costs       => [99,100],
+                   :capacities  => [1000,1001], # bad capacity: 1001
+                   :demands     => [-1,1],
+                   :large       => 1000,
+                   :max_cost    => 100)
+    end
+  end
+
+  def test_infeasible
+    #
+    # A problem for which the phase 1 init doesn't detect infeasibility.
+    #
+    #         (1)             (6)    all edges have capacity 1
+    #            \           /       1 unit surplus for 1, 2
+    #             \         /        1 unit deficit for 6, 7
+    #             (3)-->--(4)        link (3, 4) is the bottleneck
+    #             /         \
+    #            /           \
+    #         (2)             (7)
+    #
+    prob = {
+      :demands     => [-1, -1, 0, 0, 1, 1],
+      :start_nodes => [  1,  2,  3,  4, 4],
+      :end_nodes   => [  3,  3,  4,  5, 6],
+      :costs       => [  1,  1,  1,  1, 1],
+      :capacities  => [  1,  1,  1,  1, 1]}
+    
+    assert_raise Relax4::InfeasibleError do
+      Relax4.solve(prob)
+    end
+    assert_raise Relax4::InfeasibleError do
+      Relax4.solve(prob.merge(:auction_init => true))
+    end
+  end
+end

data/test/test_solve_4.inp

@@ -0,0 +1,258 @@
+17      240
+1       2       244     500000000
+1       3       738     500000000
+1       4       643     500000000
+1       5       578     500000000
+1       6       514     500000000
+1       7       433     500000000
+1       8       365     500000000
+1       9       294     500000000
+1       10      140     500000000
+1       11      79      500000000
+1       12      169     500000000
+1       13      287     500000000
+1       14      359     500000000
+1       15      207     500000000
+2       1       32      500000000
+2       3       769     500000000
+2       4       674     500000000
+2       5       609     500000000
+2       6       545     500000000
+2       7       464     500000000
+2       8       396     500000000
+2       9       325     500000000
+2       10      171     500000000
+2       11      110     500000000
+2       12      200     500000000
+2       13      318     500000000
+2       14      390     500000000
+2       15      238     500000000
+3       1       103     500000000
+3       2       72      500000000
+3       4       745     500000000
+3       5       680     500000000
+3       6       616     500000000
+3       7       535     500000000
+3       8       467     500000000
+3       9       396     500000000
+3       10      242     500000000
+3       11      181     500000000
+3       12      271     500000000
+3       13      389     500000000
+3       14      461     500000000
+3       15      309     500000000
+4       1       198     500000000
+4       2       167     500000000
+4       3       96      500000000
+4       5       775     500000000
+4       6       711     500000000
+4       7       630     500000000
+4       8       562     500000000
+4       9       491     500000000
+4       10      337     500000000
+4       11      276     500000000
+4       12      366     500000000
+4       13      484     500000000
+4       14      556     500000000
+4       15      404     500000000
+5       1       263     500000000
+5       2       232     500000000
+5       3       161     500000000
+5       4       66      500000000
+5       6       776     500000000
+5       7       695     500000000
+5       8       627     500000000
+5       9       556     500000000
+5       10      402     500000000
+5       11      341     500000000
+5       12      431     500000000
+5       13      549     500000000
+5       14      621     500000000
+5       15      469     500000000
+6       1       327     500000000
+6       2       296     500000000
+6       3       225     500000000
+6       4       130     500000000
+6       5       65      500000000
+6       7       759     500000000
+6       8       691     500000000
+6       9       620     500000000
+6       10      466     500000000
+6       11      405     500000000
+6       12      495     500000000
+6       13      613     500000000
+6       14      685     500000000
+6       15      533     500000000
+7       1       408     500000000
+7       2       377     500000000
+7       3       306     500000000
+7       4       211     500000000
+7       5       146     500000000
+7       6       82      500000000
+7       8       772     500000000
+7       9       701     500000000
+7       10      547     500000000
+7       11      486     500000000
+7       12      576     500000000
+7       13      694     500000000
+7       14      766     500000000
+7       15      614     500000000
+8       1       476     500000000
+8       2       445     500000000
+8       3       374     500000000
+8       4       279     500000000
+8       5       214     500000000
+8       6       150     500000000
+8       7       69      500000000
+8       9       769     500000000
+8       10      615     500000000
+8       11      554     500000000
+8       12      644     500000000
+8       13      762     500000000
+8       14      834     500000000
+8       15      682     500000000
+9       1       547     500000000
+9       2       516     500000000
+9       3       445     500000000
+9       4       350     500000000
+9       5       285     500000000
+9       6       221     500000000
+9       7       140     500000000
+9       8       72      500000000
+9       10      686     500000000
+9       11      625     500000000
+9       12      715     500000000
+9       13      833     500000000
+9       14      905     500000000
+9       15      753     500000000
+10      1       136     500000000
+10      2       105     500000000
+10      3       599     500000000
+10      4       504     500000000
+10      5       439     500000000
+10      6       375     500000000
+10      7       294     500000000
+10      8       226     500000000
+10      9       155     500000000
+10      11      214     500000000
+10      12      304     500000000
+10      13      422     500000000
+10      14      494     500000000
+10      15      342     500000000
+11      1       231     500000000
+11      2       200     500000000
+11      3       968     500000000
+11      4       873     500000000
+11      5       808     500000000
+11      6       744     500000000
+11      7       663     500000000
+11      8       595     500000000
+11      9       524     500000000
+11      10      370     500000000
+11      12      91      500000000
+11      13      209     500000000
+11      14      281     500000000
+11      15      129     500000000
+12      1       388     500000000
+12      2       357     500000000
+12      3       1125    500000000
+12      4       1030    500000000
+12      5       965     500000000
+12      6       901     500000000
+12      7       820     500000000
+12      8       752     500000000
+12      9       681     500000000
+12      10      527     500000000
+12      11      466     500000000
+12      13      119     500000000
+12      14      191     500000000
+12      15      286     500000000
+13      1       270     500000000
+13      2       239     500000000
+13      3       1007    500000000
+13      4       912     500000000
+13      5       847     500000000
+13      6       783     500000000
+13      7       702     500000000
+13      8       634     500000000
+13      9       563     500000000
+13      10      409     500000000
+13      11      348     500000000
+13      12      438     500000000
+13      14      73      500000000
+13      15      168     500000000
+14      1       198     500000000
+14      2       167     500000000
+14      3       935     500000000
+14      4       840     500000000
+14      5       775     500000000
+14      6       711     500000000
+14      7       630     500000000
+14      8       562     500000000
+14      9       491     500000000
+14      10      337     500000000
+14      11      276     500000000
+14      12      366     500000000
+14      13      484     500000000
+14      15      96      500000000
+15      1       103     500000000
+15      2       72      500000000
+15      3       840     500000000
+15      4       745     500000000
+15      5       680     500000000
+15      6       616     500000000
+15      7       535     500000000
+15      8       467     500000000
+15      9       396     500000000
+15      10      242     500000000
+15      11      181     500000000
+15      12      271     500000000
+15      13      389     500000000
+15      14      461     500000000
+16      1       0       500000000
+16      2       0       500000000
+16      3       0       500000000
+16      4       0       500000000
+16      5       0       500000000
+16      6       0       500000000
+16      7       0       500000000
+16      8       0       500000000
+16      9       0       500000000
+16      10      0       500000000
+16      11      0       500000000
+16      12      0       500000000
+16      13      0       500000000
+16      14      0       500000000
+16      15      0       500000000
+1       17      0       500000000
+2       17      0       500000000
+3       17      0       500000000
+4       17      0       500000000
+5       17      0       500000000
+6       17      0       500000000
+7       17      0       500000000
+8       17      0       500000000
+9       17      0       500000000
+10      17      0       500000000
+11      17      0       500000000
+12      17      0       500000000
+13      17      0       500000000
+14      17      0       500000000
+15      17      0       500000000
+4
+78
+-1
+-1
+0
+0
+0
+0
+0
+0
+3
+3
+22
+11
+20
+0
+-139

data/test/test_solve_5.inp

@@ -0,0 +1,259 @@
+17	240
+1	2	244	50000000
+1	3	738	50000000
+1	4	643	50000000
+1	5	578	50000000
+1	6	514	50000000
+1	7	433	50000000
+1	8	365	50000000
+1	9	294	50000000
+1	10	140	50000000
+1	11	79	50000000
+1	12	169	50000000
+1	13	287	50000000
+1	14	359	50000000
+1	15	207	50000000
+2	1	32	50000000
+2	3	769	50000000
+2	4	674	50000000
+2	5	609	50000000
+2	6	545	50000000
+2	7	464	50000000
+2	8	396	50000000
+2	9	325	50000000
+2	10	171	50000000
+2	11	110	50000000
+2	12	200	50000000
+2	13	318	50000000
+2	14	390	50000000
+2	15	238	50000000
+3	1	103	50000000
+3	2	72	50000000
+3	4	745	50000000
+3	5	680	50000000
+3	6	616	50000000
+3	7	535	50000000
+3	8	467	50000000
+3	9	396	50000000
+3	10	242	50000000
+3	11	181	50000000
+3	12	271	50000000
+3	13	389	50000000
+3	14	461	50000000
+3	15	309	50000000
+4	1	198	50000000
+4	2	167	50000000
+4	3	96	50000000
+4	5	775	50000000
+4	6	711	50000000
+4	7	630	50000000
+4	8	562	50000000
+4	9	491	50000000
+4	10	337	50000000
+4	11	276	50000000
+4	12	366	50000000
+4	13	484	50000000
+4	14	556	50000000
+4	15	404	50000000
+5	1	263	50000000
+5	2	232	50000000
+5	3	161	50000000
+5	4	66	50000000
+5	6	776	50000000
+5	7	695	50000000
+5	8	627	50000000
+5	9	556	50000000
+5	10	402	50000000
+5	11	341	50000000
+5	12	431	50000000
+5	13	549	50000000
+5	14	621	50000000
+5	15	469	50000000
+6	1	327	50000000
+6	2	296	50000000
+6	3	225	50000000
+6	4	130	50000000
+6	5	65	50000000
+6	7	759	50000000
+6	8	691	50000000
+6	9	620	50000000
+6	10	466	50000000
+6	11	405	50000000
+6	12	495	50000000
+6	13	613	50000000
+6	14	685	50000000
+6	15	533	50000000
+7	1	408	50000000
+7	2	377	50000000
+7	3	306	50000000
+7	4	211	50000000
+7	5	146	50000000
+7	6	82	50000000
+7	8	772	50000000
+7	9	701	50000000
+7	10	547	50000000
+7	11	486	50000000
+7	12	576	50000000
+7	13	694	50000000
+7	14	766	50000000
+7	15	614	50000000
+8	1	476	50000000
+8	2	445	50000000
+8	3	374	50000000
+8	4	279	50000000
+8	5	214	50000000
+8	6	150	50000000
+8	7	69	50000000
+8	9	769	50000000
+8	10	615	50000000
+8	11	554	50000000
+8	12	644	50000000
+8	13	762	50000000
+8	14	834	50000000
+8	15	682	50000000
+9	1	547	50000000
+9	2	516	50000000
+9	3	445	50000000
+9	4	350	50000000
+9	5	285	50000000
+9	6	221	50000000
+9	7	140	50000000
+9	8	72	50000000
+9	10	686	50000000
+9	11	625	50000000
+9	12	715	50000000
+9	13	833	50000000
+9	14	905	50000000
+9	15	753	50000000
+10	1	136	50000000
+10	2	105	50000000
+10	3	599	50000000
+10	4	504	50000000
+10	5	439	50000000
+10	6	375	50000000
+10	7	294	50000000
+10	8	226	50000000
+10	9	155	50000000
+10	11	214	50000000
+10	12	304	50000000
+10	13	422	50000000
+10	14	494	50000000
+10	15	342	50000000
+11	1	231	50000000
+11	2	200	50000000
+11	3	968	50000000
+11	4	873	50000000
+11	5	808	50000000
+11	6	744	50000000
+11	7	663	50000000
+11	8	595	50000000
+11	9	524	50000000
+11	10	370	50000000
+11	12	91	50000000
+11	13	209	50000000
+11	14	281	50000000
+11	15	129	50000000
+12	1	388	50000000
+12	2	357	50000000
+12	3	1125	50000000
+12	4	1030	50000000
+12	5	965	50000000
+12	6	901	50000000
+12	7	820	50000000
+12	8	752	50000000
+12	9	681	50000000
+12	10	527	50000000
+12	11	466	50000000
+12	13	119	50000000
+12	14	191	50000000
+12	15	286	50000000
+13	1	270	50000000
+13	2	239	50000000
+13	3	1007	50000000
+13	4	912	50000000
+13	5	847	50000000
+13	6	783	50000000
+13	7	702	50000000
+13	8	634	50000000
+13	9	563	50000000
+13	10	409	50000000
+13	11	348	50000000
+13	12	438	50000000
+13	14	73	50000000
+13	15	168	50000000
+14	1	198	50000000
+14	2	167	50000000
+14	3	935	50000000
+14	4	840	50000000
+14	5	775	50000000
+14	6	711	50000000
+14	7	630	50000000
+14	8	562	50000000
+14	9	491	50000000
+14	10	337	50000000
+14	11	276	50000000
+14	12	366	50000000
+14	13	484	50000000
+14	15	96	50000000
+15	1	103	50000000
+15	2	72	50000000
+15	3	840	50000000
+15	4	745	50000000
+15	5	680	50000000
+15	6	616	50000000
+15	7	535	50000000
+15	8	467	50000000
+15	9	396	50000000
+15	10	242	50000000
+15	11	181	50000000
+15	12	271	50000000
+15	13	389	50000000
+15	14	461	50000000
+16	1	0	50000000
+16	2	0	50000000
+16	3	0	50000000
+16	4	0	50000000
+16	5	0	50000000
+16	6	0	50000000
+16	7	0	50000000
+16	8	0	50000000
+16	9	0	50000000
+16	10	0	50000000
+16	11	0	50000000
+16	12	0	50000000
+16	13	0	50000000
+16	14	0	50000000
+16	15	0	50000000
+1	17	0	50000000
+2	17	0	50000000
+3	17	0	50000000
+4	17	0	50000000
+5	17	0	50000000
+6	17	0	50000000
+7	17	0	50000000
+8	17	0	50000000
+9	17	0	50000000
+10	17	0	50000000
+11	17	0	50000000
+12	17	0	50000000
+13	17	0	50000000
+14	17	0	50000000
+15	17	0	50000000
+2
+-2
+-6
+-12
+-13
+-5
+-5
+1
+2
+1
+10
+11
+8
+2
+1
+5
+0
+

metadata

@@ -1,13 +1,13 @@
 --- !ruby/object:Gem::Specification 
 name: relax4
 version: !ruby/object:Gem::Version 
-  hash: 17
+  hash: 31
   prerelease: false
   segments: 
   - 1
   - 0
-  - 3
-  version: 1.0.3
+  - 4
+  version: 1.0.4
 platform: ruby
 authors: 
 - John Lees-Miller
@@ -15,19 +15,21 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-09-07 00:00:00 +01:00
+date: 2010-09-24 00:00:00 +01:00
 default_executable: 
 dependencies: []
 
-description: Ruby interface for the RELAX IV code by D.P. Bertsekas and P. Tseng.
+description: |
+  Ruby interface for the RELAX IV code by D.P. Bertsekas and P. Tseng.
+
 email: 
 - jdleesmiller@gmail.com
 executables: []
 
 extensions: 
 - ext/extconf.rb
-extra_rdoc_files: []
-
+extra_rdoc_files: 
+- README.rdoc
 files: 
 - lib/relax4.rb
 - lib/relax4/version.rb
@@ -36,16 +38,20 @@ files:
 - ext/relax4.h
 - ext/relax4_wrap.c
 - README.rdoc
+- test/RELAX4.INP
+- test/test_solve_4.inp
+- test/test_solve_5.inp
+- test/test_relax4.rb
 has_rdoc: true
 homepage: http://relax4.rubyforge.org/
 licenses: []
 
 post_install_message: 
-rdoc_options: []
-
+rdoc_options: 
+- --main
+- README.rdoc
 require_paths: 
 - lib
-- lib
 - ext
 required_ruby_version: !ruby/object:Gem::Requirement 
   none: false
@@ -72,5 +78,5 @@ rubygems_version: 1.3.7
 signing_key: 
 specification_version: 3
 summary: The RELAX IV code for the Minimum Cost Network Flow Problem
-test_files: []
-
+test_files: 
+- test/test_relax4.rb