Merge pull request #23 from gdalle/astar_test

Astar test

Author: gdalle

Project.toml

@@ -10,5 +10,5 @@ SparseArrays = "2f01184e-e22b-5df5-ae63-d93ebab69eaf"
 Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"
 
 [compat]
-Graphs = "1.4"
+Graphs = "1.7"
 julia = "1"

test/a_star.jl

@@ -0,0 +1,11 @@
+@testset verbose = true "A*" begin
+    g = SimpleWeightedGraph(3)  # or use `SimpleWeightedDiGraph` for directed graphs
+    add_edge!(g, 1, 2, 0.5)
+    add_edge!(g, 2, 3, 0.8)
+    add_edge!(g, 1, 3, 2.0)
+    @test_broken length(a_star(g, 1, 3)) == 2
+    distmx = weights(g)
+    heuristic(v) = 0
+    edgetype_to_return = Graphs.SimpleEdge
+    @test length(a_star(g, 1, 3, distmx, heuristic, edgetype_to_return)) == 2
+end

test/connectivity.jl

@@ -2,11 +2,11 @@ const graphs = [
 :bull,
 :chvatal,
 :house
-]                    
-@testset "Connectivity" begin
+]
+@testset verbose = true "Connectivity" begin
      for s in graphs
          gx = smallgraph(s)
- 
+
          for g in testgraphs(gx)
              a = adjacency_matrix(g)
              x = connected_components(g)

test/overrides.jl

@@ -1,4 +1,4 @@
-@testset "Overrides" begin
+@testset verbose = true "Overrides" begin
     g3 = SimpleWeightedGraph(path_graph(5))
     g3_d = [1. 0. 0. 0. 0.;
             0. 2. 0. 0. 0.;

test/persistence.jl

@@ -1,4 +1,4 @@
-@testset "Persistence" begin
+@testset verbose = true "Persistence" begin
 gpath = joinpath(testdir, "testdata")
 pdict = loadgraphs(joinpath(gpath, "swgs.jgz"), SWGFormat())
 p1 = pdict["g"]

test/runtests.jl

@@ -16,10 +16,11 @@ tests = [
     "simpleweightedgraph",
     "overrides",
     "persistence",
-    "connectivity"
+    "connectivity",
+    "a_star"
 ]
 
-@testset "SimpleWeightedGraphs" begin
+@testset verbose = true "SimpleWeightedGraphs" begin
     for t in tests
         tp = joinpath(testdir, "$(t).jl")
         include(tp)

test/simpleweightededge.jl

@@ -1,5 +1,5 @@
 import SimpleWeightedGraphs.SimpleWeightedEdge
-@testset "SimpleWeightedEdge" begin
+@testset verbose = true "SimpleWeightedEdge" begin
     e = SimpleWeightedEdge(1, 2, 0.5)
     e2 = SimpleWeightedEdge(1, 2)
     e3 = SimpleWeightedEdge(1, 2, 1)

test/simpleweightedgraph.jl

@@ -1,6 +1,6 @@
 using SimpleWeightedGraphs
 
-@testset "SimpleWeightedGraphs" begin
+@testset verbose = true "SimpleWeightedGraphs" begin
     @info("Ignore warnings relating to adding and removing vertices and edges")
     adjmx1 = [0 1 0; 1 1 1; 0 1 0] # SimpleWeightedGraph
     adjmx2 = [0 1 0; 1 1 1; 1 1 0] # SimpleWeightedDiGraph
@@ -263,7 +263,7 @@ using SimpleWeightedGraphs
             @test_throws BoundsError g[3, 4, Val{:weight}()]
             @test_throws MethodError g[1, 2, Val{:wight}()]
             add_edge!(g, 1, 2, 5.0)
-            
+
             @test g[1, 2, Val{:weight}()] ≈ 5
             if is_directed(G)
                 @test g[2, 1, Val{:weight}()] ≈ 0
@@ -292,7 +292,7 @@ using SimpleWeightedGraphs
         @test g1 == g2
         @test ne(g1) == 5 # 1-2 1-3 2-3 3-4 4-1
         @test g1[1, 3, Val{:weight}()] ≈ 2.5
-        
+
         g = SimpleWeightedGraph(cycle_graph(5))
         g2 = SimpleWeightedGraph(g)
         @test g[1, 3, Val{:weight}()] ≈ 0
@@ -317,7 +317,7 @@ using SimpleWeightedGraphs
         @test dg[2, 1, Val{:weight}()] ≈ 0
         add_edge!(dg, 2, 1, 0.6)
         g = SimpleWeightedGraph(dg)
-        @test g[1, 2, Val{:weight}()] ≈ 1.1        
+        @test g[1, 2, Val{:weight}()] ≈ 1.1
         @test g[1, 3, Val{:weight}()] ≈ 0
         @test g[2, 3, Val{:weight}()] ≈ 0.5
     end