C#-only solver for the rectangular linear assignment problem, also known as the minimum weight full matching problem for bipartite graphs. Algorithms used include shortest augmenting path search and cost-scaling pseudoflow based assignment.
This framework aims to implement the concept of graph expression in the .NET language. With this framework it is possible to create any kind of searches on complex or circular objects in a way similar to what JQUERY does in JavaScript.