Home
last modified time | relevance | path

Searched refs:in_edges_begin (Results 1 – 6 of 6) sorted by relevance

/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bgrl2/
H A Dbgrl2_graph.hxx57 remove_edge(*v->in_edges_begin()); in remove_vertex()
388 for ( vertex_edge_iterator itr = v->in_edges_begin(); in cyclic_adj_succ()
447 for ( vertex_edge_iterator itr = v->in_edges_begin(); in cyclic_adj_pred()
452 if (itr == v->in_edges_begin()) in cyclic_adj_pred()
H A Dbgrl2_vertex.h49 edge_iterator in_edges_begin() { return in_edges_.begin(); } in in_edges_begin() function
/dports/math/cgal/CGAL-5.3/include/CGAL/Arrangement_2/
H A Dgraph_traits_dual.h300 Incident_edge_iterator in_edges_begin(Vertex_handle v) const in in_edges_begin() function
468 { return std::make_pair(darr.in_edges_begin(v), darr.in_edges_end(v)); }
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A Dgraph_traits_Arrangement_2.h313 in_edge_iterator in_edges_begin (vertex_descriptor v) in in_edges_begin() function
502 return std::make_pair (gt_arr.in_edges_begin (v), gt_arr.in_edges_end (v)); in in_edges()
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/brec/
H A Dbrec_part_hierarchy_detector.cxx390 for (auto eit = hp->in_edges_begin(); eit != hp->in_edges_end(); eit++) { in extract_upper_layer()
596 for (auto eit = hp->in_edges_begin(); eit != hp->in_edges_end(); eit++) { in extract_upper_layer()
H A Dbrec_part_hierarchy.cxx440 for (auto eit = hp->in_edges_begin(); eit != hp->in_edges_end(); eit++) { in extract_upper_layer()