60 std::vector<triplet_t> edges(idx[tnVtx]);
64 for (
int i=0; i<tnVtx; i++){
65 for (
int jj=idx[i]; jj<idx[i+1]; jj++){
70 edges[k].val = wgt[k];
77 std::sort (edges.begin(), edges.end(), compare_triplets<vtx_t,wgt_t>);
81 for (
typename std::vector<triplet_t>::iterator it=edges.begin();
82 it!=edges.end(); ++it){
87 if ((match[it->i] == it->i) && (match[it->j] == it->j )){