Implementation of the sequential b-Suitor algorithm by Khan et al. and required b-matching classes.

• BMatching.hpp represents basic properties of a b-matching data structure. It has a similar functionality as the Matching.hpp class. (They could be merged or inherit as 1-matching from b-matching if the performance remains stable.)
• BMatcher.hpp is the abstract base class for b-matching algorithms.
• BSuitorMatcher.hpp adds the sequential b-Suitor with a b-function. It can be used to compute a b-matching for a given undirected weighted graph and any b. E.g.:

auto G = METISGraphReader{}.read("input/tiny_02.graph");
const int b = 2;
BSuitorMatcher bsm(G, b);
bsm.run();
const auto M = bsm.getBMatching();

computes the 2-matching for the tiny_02 graph

3 2  2 1
1 1 
1 2  5 3 
7 5  6 2 
3 3 
4 2  7 6 
4 5  6 6

in (vertex_neighbor,edge_weight) METIS-like format with a weight of 19.