Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Project.toml
Original file line number Diff line number Diff line change
Expand Up @@ -99,7 +99,7 @@ CommonSolve = "0.2.4"
Compat = "3.42, 4"
ConstructionBase = "1"
DataInterpolations = "7, 8"
DataStructures = "0.17, 0.18"
DataStructures = "0.19"
DeepDiffs = "1"
DelayDiffEq = "5.50"
DiffEqBase = "6.170.1"
Expand Down
1 change: 1 addition & 0 deletions src/ModelingToolkit.jl
Original file line number Diff line number Diff line change
Expand Up @@ -29,6 +29,7 @@ using LinearAlgebra, SparseArrays
using InteractiveUtils
using JumpProcesses
using DataStructures
import DataStructures: IntDisjointSet
using Base.Threads
using Latexify, Unitful, ArrayInterface
using Setfield, ConstructionBase
Expand Down
6 changes: 3 additions & 3 deletions src/systems/alias_elimination.jl
Original file line number Diff line number Diff line change
Expand Up @@ -426,20 +426,20 @@ function topsort_equations(eqs, unknowns; check = true)

q = Queue{Int}(neqs)
for (i, d) in enumerate(degrees)
d == 0 && enqueue!(q, i)
d == 0 && push!(q, i)
end

idx = 0
ordered_eqs = similar(eqs, 0)
sizehint!(ordered_eqs, neqs)
while !isempty(q)
𝑠eq = dequeue!(q)
𝑠eq = popfirst!(q)
idx += 1
push!(ordered_eqs, eqs[𝑠eq])
var = assigns[𝑠eq]
for 𝑑eq in 𝑑neighbors(graph, var)
degree = degrees[𝑑eq] = degrees[𝑑eq] - 1
degree == 0 && enqueue!(q, 𝑑eq)
degree == 0 && push!(q, 𝑑eq)
end
end

Expand Down
2 changes: 1 addition & 1 deletion src/systems/connectiongraph.jl
Original file line number Diff line number Diff line change
Expand Up @@ -452,7 +452,7 @@ function connectionsets(graph::ConnectionGraph)
invmap = graph.invmap

# union all of the hyperedges
disjoint_sets = IntDisjointSets(length(invmap))
disjoint_sets = IntDisjointSet(length(invmap))
for edge_i in 𝑠vertices(bigraph)
hyperedge = 𝑠neighbors(bigraph, edge_i)
isempty(hyperedge) && continue
Expand Down
Loading