git-svn-id: http://igraph.rubyforge.org/svn/trunk@13 71f48855-0bbf-4aa5-930d-4df415e86613

test/tc_shortest_paths.rb~

@@ -1,28 +0,0 @@
-require 'test/unit'
-require 'igraph'
-require 'mocha'
-
-class TestGraph < Test::Unit::TestCase
-  def test_shortest_paths
-    graph = IGraph.new(['A','B','C','D'],true)
-    m = graph.shortest_paths(['A'],IGraph::ALL)
-    assert_equal 1, m[0][1]
-    assert_equal 0, m[0][0]
-    assert_equal graph.vcount, m[0].size
-    assert_equal nil, m[0][2]
-  end
-
-  def test_get_shortest_paths_warn
-    graph = IGraph.new(['A','B','C','D'],true)
-    graph.expects(:warn).with("Couldn't reach some vertices")
-    graph.get_shortest_paths('A',['B','C'],IGraph::ALL)
-  end
-
-  def test_get_shortest_paths
-    graph = IGraph.new(['A','B','C','D'],true)    
-    m = graph.get_shortest_paths('A',['B','C'],IGraph::ALL)
-    assert_equal ['A','B'], m[0]
-    assert_equal [],        m[1]
-  end
-
-end