Lines Matching refs:b_base

328         vertex_descriptor_t b_base)  in missing_label()  argument
330 vertex_descriptor_t missing_outlet = outlet[b_base]; in missing_label()
332 if (outlet[b_base] == b_base) in missing_label()
341 outlet[b_base], graph::detail::V_EVEN); in missing_label()
347 if (child.first == b_base) in missing_label()
362 if (child_parent.first == b_base) in missing_label()
404 vertex_descriptor_t b_base = b->get_base(); in expand_T_blossom() local
406 = missing_label(b_base); in expand_T_blossom()
437 if (label_T[b_base] == graph_traits< Graph >::null_vertex() in expand_T_blossom()
438 || tau[old_label[b_base].second] < pi[b_base]) in expand_T_blossom()
439 boost::tie(label_T[b_base], outlet[b_base]) = T_and_outlet; in expand_T_blossom()
806 vertex_descriptor_t b_base = b->get_base(); in blossoming() local
814 if (*vi != b_base && *vi == base_vertex(*vi)) in blossoming()
831 critical_edge[b_base][*i] = critical_edge[*i][b_base] = b_vi; in blossoming()
833 gamma[b_base] = std::numeric_limits< edge_property_t >::max(); in blossoming()
836 if (critical_edge[b_base][*i] != null_edge) in blossoming()
837 gamma[b_base] = std::min( in blossoming()
838 gamma[b_base], slack(critical_edge[b_base][*i].first)); in blossoming()
1000 vertex_descriptor_t b_base = (*bi)->get_base(); in adjust_dual() local
1001 if (label_T[b_base] != graph_traits< Graph >::null_vertex() in adjust_dual()
1002 && pi[b_base] == 0) in adjust_dual()
1034 vertex_descriptor_t b_base = (*bi)->get_base(); in adjust_dual() local
1035 if (label_T[b_base] != graph_traits< Graph >::null_vertex() in adjust_dual()
1036 && pi[b_base] == 0) in adjust_dual()
1038 if (label_S[b_base] != graph_traits< Graph >::null_vertex()) in adjust_dual()
1068 vertex_descriptor_t b_base = b->get_base(); in adjust_dual() local
1070 && label_T[b_base] != graph_traits< Graph >::null_vertex() in adjust_dual()
1071 && pi[b_base] == 0) in adjust_dual()