format test

Author: Krastanov

test/biconnectivity/articulation.jl

@@ -27,7 +27,7 @@
         btree = Graphs.binary_tree(level)
         for tree in test_generic_graphs(btree; eltypes=[Int, UInt8, Int16])
             artpts = @inferred(articulation(tree))
-            @test artpts == collect(1:(2^(level - 1) - 1))
+            @test artpts == collect(1:(2 ^ (level - 1) - 1))
         end
     end
 

test/centrality/eigenvector.jl

@@ -4,8 +4,7 @@
 
     for g in test_generic_graphs(g1)
         y = @inferred(eigenvector_centrality(g))
-        @test round.(y, digits=3) ==
-            round.(
+        @test round.(y, digits=3) == round.(
             [
                 0.3577513877490464,
                 0.3577513877490464,

test/simplegraphs/runtests.jl

@@ -1,7 +1,8 @@
 using Graphs.SimpleGraphs
 
 import Graphs.SimpleGraphs: fadj, badj, adj
-import Graphs.edgetype, Graphs.has_edge
+using Graphs.edgetype: edgetype
+using Graphs.has_edge: has_edge
 using Statistics: mean
 
 struct DummySimpleGraph <: AbstractSimpleGraph{Int} end

test/simplegraphs/simplegraphs.jl

@@ -322,8 +322,9 @@ using Graphs.Test
             SimpleGraph(0)
         )
             E = edgetype(g)
-            edge_list =
-                E.([(4, 4), (1, 2), (4, 4), (1, 2), (4, 4), (2, 1), (0, 1), (1, 0), (0, 0)])
+            edge_list = E.([
+                (4, 4), (1, 2), (4, 4), (1, 2), (4, 4), (2, 1), (0, 1), (1, 0), (0, 0)
+            ])
             edge_iter = (e for e in edge_list)
             edge_set = Set(edge_list)
             edge_set_any = Set{Any}(edge_list)
@@ -352,8 +353,9 @@ using Graphs.Test
             SimpleDiGraph(0)
         )
             E = edgetype(g)
-            edge_list =
-                E.([(4, 4), (1, 2), (4, 4), (1, 2), (4, 4), (2, 1), (0, 1), (1, 0), (0, 0)])
+            edge_list = E.([
+                (4, 4), (1, 2), (4, 4), (1, 2), (4, 4), (2, 1), (0, 1), (1, 0), (0, 0)
+            ])
             edge_iter = (e for e in edge_list)
             edge_set = Set(edge_list)
             edge_set_any = Set{Any}(edge_list)