Searched refs:m_neighbors (Results 1 – 3 of 3) sorted by relevance
29 m_neighbors.reserve(m_count); in distance_query_result()34 if ( m_neighbors.size() < m_count ) in store()36 m_neighbors.push_back(std::make_pair(curr_comp_dist, val)); in store()38 if ( m_neighbors.size() == m_count ) in store()39 std::make_heap(m_neighbors.begin(), m_neighbors.end(), neighbors_less); in store()43 if ( curr_comp_dist < m_neighbors.front().first ) in store()45 std::pop_heap(m_neighbors.begin(), m_neighbors.end(), neighbors_less); in store()46 m_neighbors.back().first = curr_comp_dist; in store()47 m_neighbors.back().second = val; in store()48 std::push_heap(m_neighbors.begin(), m_neighbors.end(), neighbors_less); in store()[all …]
145 = m_neighbors[v->id()].begin(); in has_cycles()146 nit != m_neighbors[v->id()].end(); ++nit) in has_cycles()171 , m_neighbors(num_rings) in complement_graph()192 m_neighbors.push_back(neighbor_container()); in add_vertex()202 m_neighbors[v1->id()].insert(v2); in add_edge()203 m_neighbors[v2->id()].insert(v1); in add_edge()231 std::vector<neighbor_container> m_neighbors; member in boost::geometry::detail::is_valid::complement_graph
49 nit = graph.m_neighbors[it->id()].begin(); in debug_print_complement_graph()50 nit != graph.m_neighbors[it->id()].end(); ++nit) in debug_print_complement_graph()