Cleanup and bump version

Author: BatyLeo

CITATION.bib

@@ -2,7 +2,7 @@ @misc{ConstrainedShortestPaths.jl
 	author  = {Léo Baty and contributors},
 	title   = {ConstrainedShortestPaths.jl},
 	url     = {https://github.com/BatyLeo/ConstrainedShortestPaths.jl},
-	version = {v0.6.2},
+	version = {v0.6.3},
 	year    = {2024},
 	month   = {12}
 }

Project.toml

@@ -1,7 +1,7 @@
 name = "ConstrainedShortestPaths"
 uuid = "b3798467-87dc-4d99-943d-35a1bd39e395"
 authors = ["Léo Baty and contributors"]
-version = "0.6.2"
+version = "0.6.3"
 
 [deps]
 DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8"

src/algorithms.jl

@@ -10,7 +10,6 @@ function compute_bounds(instance::CSPInstance{T,G,FR,BR}; kwargs...) where {T,G,
     @assert vertices_order[1] == destination_vertex
 
     bounds = Dict{Int,BR}()
-    # bounds = Vector{typeof(instance.destination_backward_resource)}(undef, nv(graph))
     bounds[destination_vertex] = instance.destination_backward_resource
 
     for vertex in vertices_order[2:end]

src/utils/utils.jl

@@ -10,13 +10,6 @@ end
 # Remove all elements in Mw that are dominated by rq
 function remove_dominated!(Mw::AbstractVector{R}, rq::R) where {R}
     filter!(r -> !(rq <= r), Mw)
-    # to_delete = Int[]
-    # for (i, r) in enumerate(Mw)
-    #     if rq <= r
-    #         push!(to_delete, i)
-    #     end
-    # end
-    # deleteat!(Mw, to_delete)
     return nothing
 end