SBG Vertical sorting

[Kalashnikovni]

I'll implement a new version to generate a causalized model that is used afterwards to generate simulation code. The main changes are the following:

• Add guess vertices that are entry points of each SCC.
• Add residual vertices that are the exit points of each SCC.
  This change allows the distinction between models that have many SCCs from those that have a large SCC. For example, for a model with many SCCs the output will be something like:

for i in 1:N loop
  guessA = ...;
  eq1;
  ...
  eqk;
  resA = ...;
end for;

In contrast, if a model has a large SCC the output will:

guessA = ...;
eq1;
for i in 1:N loop
  eq2;
end for;
...
resA = ...;

I'll keep iss-94 branch which has an older version of this algorithm just in case, if I need to reuse it.

[Kalashnikovni]

I started improving the ModelicaSBG structure, so that all information relating to the analyzed model is kept inside that structure. Also, I modified set-edges so the domain and translation members work as in the case of set-vertices, instead of keeping the final value directly in the domain.

• iss-95 commit

[Kalashnikovni]

Next, I rewrote the output of the horizontal sorting. Now it is a pair of (AST::Equation, AST::ExpList), because in the final result, if we have arrays of algebraic loops we must indicate the matching inside a loop, so a list of expressions is needed to represent that situation. Then I improved the code to generate Modelica code indicating the matching as a comment next to each equality.

• iss-95 commit