template<typename GR, typename CAP, typename TR>
template<class H, class CR = typename Digraph::template NodeMap<int>>
struct lemon::MaxCardinalitySearch< GR, CAP, TR >::SetHeap< H, CR >
Named parameter for setting heap and cross reference type for the algorithm.