Novel SBG algorithm to compute matching.

This version uses the SBG library novel algorithm to compute the matching stage of the compilation process.
The new SBG data structures and the new algorithm for the connected components are defined here.
For instructions and examples on how to run the matching algorithm in Modelica models, check this for details. The evaluators are implemented in the SBG library.

Implemented flattening stage using a novel SBG based connected components algorithm.

This version implements a novel algorithm to compute the connected components of a Set-Based Graph used in the flattening stage of the compilation process.
The new SBG data structures and the new algorithm for the connected components are defined here.
For instructions and examples on how to run the flatter algorithm in Modelica models, check this folder.

v2.0

Implemented matching and Tarjan algorithms using vector graph data structures as described here

v1.0

Updated readme.