Comments adressed

Deltares · Mar 19, 2024 · 247429a · 247429a
1 parent ecb91a4
commit 247429a
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/core/src/allocation_optim.jl b/core/src/allocation_optim.jl
@@ -556,7 +556,7 @@ function save_demands_and_allocations!(
             user_demand_idx = findsorted(user_demand.node_id, node_id)
             demand = user_demand.demand[user_demand_idx]
             allocated = user_demand.allocated[user_demand_idx][priority_idx]
-            #NOTE: istantaneous
+            #NOTE: instantaneous
             realized = get_flow(graph, inflow_id(graph, node_id), node_id, 0)
 
         elseif node_id.type == NodeType.Basin &&

diff --git a/docs/core/allocation.qmd b/docs/core/allocation.qmd
@@ -97,7 +97,7 @@ A new graph is created from the subnetwork, which we call an allocation network.
 The allocation network consists of:
 
 - Nodes $V'_S \subset V_S$. Nodes that are represented in the allocation network are:
-nodes of type `Basin`, `UserDemand` and `Terminal`, nodes that have fractinal flow downstream neighbors, nodes that have a flow demand and nodes that are connected to a source edge.
+nodes of type `Basin`, `UserDemand` and `Terminal`, nodes that have `FractionalFlow` downstream neighbors, nodes that have a flow demand and nodes that are connected to a source edge.
 - Edges $E_S$, which are either edges that also appear between nodes in the subnetwork or represent a sequence of those, creating a shortcut.
 
 For notational convenience, we use the notation