![]() |
libFirm
|
This module contains generic algorithms like bipartite matching or solvers for linear equation systems. More...
Topics | |
| Bipartite Matching | |
| Solved bipartite matching problem. | |
| Gauss Jordan Elimination | |
| Solves a system of linear equations | |
| Hash Functions | |
| Hungarian Algorithm | |
| Solves bipartite matching problems (minimize/maximize cost function) | |
This module contains generic algorithms like bipartite matching or solvers for linear equation systems.
They're provided as a convenience, the firm API is fully functionaly without them so you can just as well use a library like glib and libapr or write your own.