Skip to content

Commit 41c0673

Browse files
authored
Merge pull request #249 from kafu16/nb/docs_typos
few typos in the docs
2 parents 199ec24 + c59bbff commit 41c0673

File tree

7 files changed

+12
-12
lines changed

7 files changed

+12
-12
lines changed

NetworkDynamicsInspector/src/NetworkDynamicsInspector.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -123,7 +123,7 @@ end
123123
inspect(sol; restart=false, reset=false, display=nothing)
124124
125125
Main entry point for gui. Starts the server and serves the app for
126-
soution `sol`.
126+
solution `sol`.
127127
128128
- `restart`: If `true`, the display will be restartet (i.e. new Electron window, new server or new Browser tab)
129129
- `reset`: If `true`, reset the appstate with the new solution `sol`.

docs/examples/cascading_failure.jl

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
# Cascading Failure
33
This script reimplements the minimal example of a dynamic cascading failure
44
described in Schäfer et al. (2018) [1].
5-
In is an example how to use callback functions to change network parameters. In
5+
This is an example how to use callback functions to change network parameters. In
66
this case to disable certain lines.
77
This script can be dowloaded as a normal Julia script [here](@__NAME__.jl). #md
88

docs/src/callbacks.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ Within the affect function, it is safe to modify the integrator, e.g. changing s
88
Since `NetworkDynamics.jl` provides nothing more than a RHS for DifferentialEquations.jl, please check
99
[their docs on event handling](https://docs.sciml.ai/DiffEqDocs/stable/features/callback_functions/)
1010
as a general reference.
11-
This page at introducing the general concepts, for a hands on example of a simulation with callbacks
11+
This page is introducing the general concepts, for a hands on example of a simulation with callbacks
1212
refer to the [Cascading Failure](@ref) example.
1313

1414

@@ -67,7 +67,7 @@ vectoraffect = ComponentAffect([:u], [:p]) do u, p, event_idx, ctx
6767
end
6868
```
6969
Notably, the `syms` (here `:u`) can *exclusivly* refer to "ordinary" states, since they are now writable.
70-
However the affect gets passed a `ctx` "context" object, which is a named tuple which holds additional context like the integrator object, the component model, the index of the component model, the current time and so on. Please refere to the [`ComponentAffect`](@ref) docstring for a detailed list.
70+
However the affect gets passed a `ctx` "context" object, which is a named tuple which holds additional context like the integrator object, the component model, the index of the component model, the current time and so on. Please refer to the [`ComponentAffect`](@ref) docstring for a detailed list.
7171

7272
Lastly we need to define the actuall callback object using [`ContinousComponentCallback`](@ref)/[`VectorContinousComponentCallback`](@ref):
7373
```julia
@@ -116,7 +116,7 @@ condition = let getvalue = SII.getsym(nw, VIndex(1:5, :some_state))
116116
end
117117
end
118118
```
119-
Please not a few important things here:
119+
Please note a few important things here:
120120
- Symbolic indexing can be costly, and the condition function gets called very
121121
often. By using [`SII.getsym`](@extref `SymbolicIndexingInterface.getsym`) we did
122122
some of the work *before* the callback by creating the accessor function.

docs/src/mathematical_model.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# Mathematical Model
2-
The basic mathematical model of `NetworkDynamics.jl` splits up the system it two parts: vertex and edge components.
2+
The basic mathematical model of `NetworkDynamics.jl` splits up the system into two parts: vertex and edge components.
33

44
The main goal of `NetworkDynamics.jl` is, to express the overall network dynamics as a Differential-Algebraic-Equation (DAE)
55
```math

docs/src/mtk_integration.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# ModelingToolkit Integration
22

3-
NetworkDynamics.jl is compatible with [`ModelingTookit.jl`](https://github.com/SciML/ModelingToolkit.jl) (MTK).
3+
NetworkDynamics.jl is compatible with [`ModelingToolkit.jl`](https://github.com/SciML/ModelingToolkit.jl) (MTK).
44
The general idea is to use MTK to define *component models* (i.e. edge and vertex dynamics)
55
which are then connected on network scale using NetworkDynamics.
66

@@ -12,8 +12,8 @@ EdgeModel(::ODESystem, srcin, dstin, [srscout], dstout)
1212
whose docstrings can be found in the [Component Models with MTK](@ref) section in the API.
1313

1414
These constructors will:
15-
- transforming the states marked as input to parameters and `structural_simplify`ing the system,
16-
- generating the `f` and `g` functions,
15+
- transform the states marked as input to parameters and `structural_simplify`ing the system,
16+
- generate the `f` and `g` functions,
1717
- generate code for observables,
1818
- port all supported [Metadata](@ref) from MTK symbols to component symbols and
1919
- output a `Vertex-`/`EdgeModel` function compatible with NetworkDynamics.jl.

docs/src/network_construction.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
# Network Construction
22

33
## Building a Network
4-
The main type of `NetworkDyanmics.jl` is a [`Network`](@ref).
4+
The main type of `NetworkDynamics.jl` is a [`Network`](@ref).
55
A network bundles various component models (edge and vertex models) together with a graph to form a callable object which represents the RHS of the overall dynamical system, see [Mathematical Model](@ref).
66

77
A `Network` is build by passing a graph `g`, vertex models `vertexm` and edge models `edgem`.
@@ -20,7 +20,7 @@ Two important keywords for the [`Network`](@ref) constructor are:
2020
Tells the backend how to aggregate and which aggregation function to use.
2121
Aggregation is the process of creating a single vertex input by reducing over
2222
the outputs of adjecent edges of said vertex. The `aggregator` contains both the
23-
function and the algorith. E.g. `SequentialAggregator(+)` is a sequential
23+
function and the algorithm. E.g. `SequentialAggregator(+)` is a sequential
2424
aggregation by summation. A list of availabe Aggregators can be found under
2525
[`Aggregators`](@ref) in the API.
2626

docs/src/symbolic_indexing.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -69,7 +69,7 @@ To access the state or parameters of a network, you can use the [`NWState`](@ref
6969
p = NWParameter(nw)
7070
```
7171
creates a `NWParameter` object for the network `nw`.
72-
It essentially creates a new flat parameter array and fills it with the default parameter values define in the component.
72+
It essentially creates a new flat parameter array and fills it with the default parameter values defined in the component.
7373
The parameters in the `NWParameter` object can be accessed using symbolic indices.
7474
```@example si
7575
p[EPIndex(5, :K)] = 2.0 # change the parameter K of the 5th edge

0 commit comments

Comments
 (0)