v4.0.0

This release supports new functionality for parser and evaluator, and ordered the /test folder. Also now implementations of sets and pwmaps can be switched in runtime according to the user input.

Full Changelog: https://github.com/CIFASIS/sb-graph/blob/sb-graph-dev/CHANGELOG.md

SCC examples (Circuit, Test RL1, Test RL3)
To run an example the command ./bin/sbg-eval -f ./test/filename -s 2 should be executed from the /sb-graph directory.

Other files
Use ./bin/sbg-eval -f ./test/filename to execute the evuator on other test files.

v3.0.0

This release contains novel versions of the following SBG algorithms to compute:

• Maximum Matching
• Strongly Connected Components
• Topological Sort
• Minimum Vertex Cut Set

of a given SB Graph. Additionally, SCC and Topological Sort graph builders are provided.

Full Changelog: https://github.com/CIFASIS/sb-graph/blob/sb-graph-dev/CHANGELOG.md

SCC examples
To run an example the command ./bin/sbg-eval -f ./test/filename should be executed from the /sb-graph directory.

v2.0.0

This release contains SBG algorithms to compute:

• Strongly connected components
• Topological sort

of a given SB Graph. Additionally, SCC and Topological Sort graph builders are provided.

Additional features:

• SBG parser (general and compact representation in Modelica fashion).
• SBG printer (in Modelica fashion).

Full Changelog: https://github.com/CIFASIS/sb-graph/commits/v2.0.0

Matching examples
To reproduce the matching algorithm examples, download this version and follow the instructions from test/matching/README.md

v1.0.0

This release contains SBG algorithms to compute:

• Connected Components
• Matching

of a given SB Graph. Additionally, a matching graph builder is provided.

Full Changelog: https://github.com/CIFASIS/sb-graph/commits/v1.0.0