Skip to content

Commit 8dad6b5

Browse files
authored
Remove use of deprecated IntDisjointSets (#2824)
1 parent 2b3a763 commit 8dad6b5

File tree

3 files changed

+4
-2
lines changed

3 files changed

+4
-2
lines changed

.github/workflows/ci.yml

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -53,6 +53,8 @@ jobs:
5353
- uses: julia-actions/cache@v1
5454
- uses: julia-actions/julia-buildpkg@v1
5555
- uses: julia-actions/julia-runtest@v1
56+
with:
57+
depwarn: error
5658
env:
5759
MOI_TEST_MODULES: ${{ matrix.moi_test_modules }}
5860
- uses: julia-actions/julia-processcoverage@v1

Project.toml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"
2323
BenchmarkTools = "1"
2424
CodecBzip2 = "0.6, 0.7, 0.8"
2525
CodecZlib = "0.6, 0.7"
26-
DataStructures = "0.18, 0.19"
26+
DataStructures = "0.19"
2727
ForwardDiff = "0.10, 1"
2828
JSON3 = "1"
2929
JSONSchema = "1"

src/Nonlinear/ReverseAD/Coloring/Coloring.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -206,7 +206,7 @@ function acyclic_coloring(g::UndirectedGraph)
206206
firstVisitToTree = fill(_Edge(0, 0, 0), _num_edges(g))
207207
color = fill(0, _num_vertices(g))
208208
# disjoint set forest of edges in the graph
209-
S = DataStructures.IntDisjointSets(_num_edges(g))
209+
S = DataStructures.IntDisjointSet(_num_edges(g))
210210
@inbounds for v in 1:_num_vertices(g)
211211
n_neighbor = _num_neighbors(v, g)
212212
start_neighbor = _start_neighbors(v, g)

0 commit comments

Comments
 (0)