106
106
end
107
107
end
108
108
109
- @testset " remove_self_loops" begin
110
- g = rand_graph (10 , 20 , graph_type= GRAPH_T)
111
- g1 = add_edges (g, [1 : 5 ;], [1 : 5 ;])
112
- @test g1. num_edges == g. num_edges + 5
113
- g2 = remove_self_loops (g)
114
- @test g2. num_edges == g. num_edges
115
- @test sort_edge_index (edge_index (g2)) == sort_edge_index (edge_index (g))
109
+ @testset " remove_self_loops" begin
110
+ if GRAPH_T == :coo
111
+ g = rand_graph (10 , 20 , graph_type= GRAPH_T)
112
+ g1 = add_edges (g, [1 : 5 ;], [1 : 5 ;])
113
+ @test g1. num_edges == g. num_edges + 5
114
+ g2 = remove_self_loops (g)
115
+ @test g2. num_edges == g. num_edges
116
+ @test sort_edge_index (edge_index (g2)) == sort_edge_index (edge_index (g))
117
+ end
116
118
end
117
119
118
- @testset " remove_multi_edges" begin
119
- g = rand_graph (10 , 20 , graph_type= GRAPH_T)
120
- s, t = edge_index (g)
121
- g1 = add_edges (g, s[1 : 5 ], t[1 : 5 ])
122
- @test g1. num_edges == g. num_edges + 5
123
- g2 = remove_multi_edges (g)
124
- @test g2. num_edges == g. num_edges
125
- @test sort_edge_index (edge_index (g2)) == sort_edge_index (edge_index (g))
120
+ @testset " remove_multi_edges" begin
121
+ if GRAPH_T == :coo
122
+ g = rand_graph (10 , 20 , graph_type= GRAPH_T)
123
+ s, t = edge_index (g)
124
+ g1 = add_edges (g, s[1 : 5 ], t[1 : 5 ])
125
+ @test g1. num_edges == g. num_edges + 5
126
+ g2 = remove_multi_edges (g)
127
+ @test g2. num_edges == g. num_edges
128
+ @test sort_edge_index (edge_index (g2)) == sort_edge_index (edge_index (g))
129
+ end
126
130
end
127
- end
131
+ end
0 commit comments