Home
last modified time | relevance | path

Searched refs:neighbors (Results 1 – 25 of 42) sorted by relevance

12

/third_party/boost/boost/graph/
Dis_kuratowski_subgraph.hpp52 void contract_edge(AdjacencyList& neighbors, Vertex u, Vertex v) in contract_edge() argument
55 neighbors[v].erase( in contract_edge()
56 std::remove(neighbors[v].begin(), neighbors[v].end(), u), in contract_edge()
57 neighbors[v].end()); in contract_edge()
63 adjacency_iterator_t u_neighbor_end = neighbors[u].end(); in contract_edge()
64 for (adjacency_iterator_t u_neighbor_itr = neighbors[u].begin(); in contract_edge()
68 std::replace(neighbors[u_neighbor].begin(), in contract_edge()
69 neighbors[u_neighbor].end(), u, v); in contract_edge()
73 neighbors[u].erase( in contract_edge()
74 std::remove(neighbors[u].begin(), neighbors[u].end(), v), in contract_edge()
[all …]
Dtransitive_reduction.hpp87 std::vector< Vertex > neighbors; in transitive_reduction() local
96 neighbors.push_back(target(*oi, g)); in transitive_reduction()
108 if (std::find(neighbors.begin(), neighbors.end(), *rit) in transitive_reduction()
109 != neighbors.end()) in transitive_reduction()
Dedge_connectivity.hpp48 void neighbors(const Graph& g, in neighbors() function
58 void neighbors(const Graph& g, VertexIterator first, VertexIterator last, in neighbors() function
62 neighbors(g, *first, result); in neighbors()
134 detail::neighbors( in edge_connectivity()
158 detail::neighbors(g, k, std::inserter(neighbor_S, neighbor_S.begin())); in edge_connectivity()
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/gnn/
Dlocal_node.cc47 std::vector<NodeIdType> neighbors; in GetAllNeighbors() local
51 neighbors.resize(itr->second.first.size()); in GetAllNeighbors()
52 std::transform(itr->second.first.begin(), itr->second.first.end(), neighbors.begin(), in GetAllNeighbors()
55 neighbors.resize(itr->second.first.size() + 1); in GetAllNeighbors()
56 neighbors[0] = id_; in GetAllNeighbors()
57 std::transform(itr->second.first.begin(), itr->second.first.end(), neighbors.begin() + 1, in GetAllNeighbors()
63 neighbors.emplace_back(id_); in GetAllNeighbors()
66 *out_neighbors = std::move(neighbors); in GetAllNeighbors()
70 Status LocalNode::GetRandomSampledNeighbors(const std::vector<std::shared_ptr<Node>> &neighbors, in… in GetRandomSampledNeighbors() argument
72 std::vector<NodeIdType> shuffled_id(neighbors.size()); in GetRandomSampledNeighbors()
[all …]
Dgraph_data_impl.cc165 std::vector<std::vector<NodeIdType>> neighbors; in GetAllNeighbors() local
172 neighbors.resize(node_list.size()); in GetAllNeighbors()
177 RETURN_IF_NOT_OK(node->GetAllNeighbors(neighbor_type, &neighbors[i])); in GetAllNeighbors()
178 …max_neighbor_num = max_neighbor_num > neighbors[i].size() ? max_neighbor_num : neighbors[i].size(); in GetAllNeighbors()
180 RETURN_IF_NOT_OK(node->GetAllNeighbors(neighbor_type, &neighbors[i], true)); in GetAllNeighbors()
181 total_edge_num += neighbors[i].size(); in GetAllNeighbors()
183 RETURN_IF_NOT_OK(node->GetAllNeighbors(neighbor_type, &neighbors[i], true)); in GetAllNeighbors()
184 total_edge_num += neighbors[i].size(); in GetAllNeighbors()
194 RETURN_IF_NOT_OK(ComplementVector<NodeIdType>(&neighbors, max_neighbor_num, kDefaultNodeId)); in GetAllNeighbors()
195 … RETURN_IF_NOT_OK(CreateTensorByVector<NodeIdType>(neighbors, DataType(DataType::DE_INT32), out)); in GetAllNeighbors()
[all …]
Dlocal_node.h86 …Status GetRandomSampledNeighbors(const std::vector<std::shared_ptr<Node>> &neighbors, int32_t samp…
89 Status GetWeightSampledNeighbors(const std::vector<std::shared_ptr<Node>> &neighbors,
/third_party/mindspore/tests/ut/cpp/dataset/
Dgnn_graph_test.cc45 …void ParsingNeighbors(const std::shared_ptr<Tensor> &neighbors, NodeNeighborsMap &node_neighbors) { in ParsingNeighbors() argument
46 auto shape_vec = neighbors->shape().AsVector(); in ParsingNeighbors()
53 for (auto node_itr = neighbors->begin<NodeIdType>(); node_itr != neighbors->end<NodeIdType>(); in ParsingNeighbors()
134 std::shared_ptr<Tensor> neighbors; in TEST_F() local
135 s = graph.GetAllNeighbors(node_list, meta_info.node_type[1], OutputFormat::kNormal, &neighbors); in TEST_F()
137 EXPECT_TRUE(neighbors->shape().ToString() == "<10,6>"); in TEST_F()
244 std::shared_ptr<Tensor> neighbors; in TEST_F() local
250 neighbors.reset(); in TEST_F()
251 …SampledNeighbors(node_list, {10}, {meta_info.node_type[1]}, SamplingStrategy::kRandom, &neighbors); in TEST_F()
253 EXPECT_TRUE(neighbors->shape().ToString() == "<5,11>"); in TEST_F()
[all …]
/third_party/boost/libs/mpi/src/
Dgraph_communicator.cpp18 shared_array<int> neighbors(new int[nneighbors]); in out_edges() local
20 ((MPI_Comm)comm, vertex, nneighbors, neighbors.get())); in out_edges()
21 return std::make_pair(detail::comm_out_edge_iterator(vertex, neighbors, 0), in out_edges()
22 detail::comm_out_edge_iterator(vertex, neighbors, in out_edges()
39 shared_array<int> neighbors(new int[nneighbors]); in adjacent_vertices() local
41 ((MPI_Comm)comm, vertex, nneighbors, neighbors.get())); in adjacent_vertices()
42 return std::make_pair(detail::comm_adj_iterator(neighbors, 0), in adjacent_vertices()
43 detail::comm_adj_iterator(neighbors, nneighbors)); in adjacent_vertices()
/third_party/boost/boost/mpi/
Dgraph_communicator.hpp265 comm_out_edge_iterator(int source, shared_array<int> neighbors, int index) in comm_out_edge_iterator() argument
266 : edge(source, -1), neighbors(neighbors), index(index) { } in comm_out_edge_iterator()
273 edge.second = neighbors[index]; in dereference()
295 shared_array<int> neighbors; member in boost::mpi::detail::comm_out_edge_iterator
315 comm_adj_iterator(shared_array<int> neighbors, int index) in comm_adj_iterator() argument
316 : neighbors(neighbors), index(index) { } in comm_adj_iterator()
321 int dereference() const { return neighbors[index]; } in dereference()
325 return (neighbors == other.neighbors in equal()
340 shared_array<int> neighbors; member in boost::mpi::detail::comm_adj_iterator
/third_party/boost/boost/geometry/index/detail/rtree/visitors/
Ddistance_query.hpp380 return *(neighbors[current_neighbor].second); in dereference()
397 if ( new_neighbor < neighbors.size() ) in increment()
403 neighbors.clear(); in increment()
420 if ( new_neighbor < neighbors.size() && in increment()
423 neighbors[new_neighbor].first < next_closest_node_distance ) in increment()
430 … BOOST_GEOMETRY_INDEX_ASSERT(neighbors.size() <= max_count(), "unexpected neighbours count"); in increment()
431 if ( max_count() <= neighbors.size() && in increment()
432 is_node_prunable(neighbors.back().first, branches[current_branch].first) ) in increment()
460 … l.neighbors[l.current_neighbor].second == r.neighbors[r.current_neighbor].second, in operator ==()
496 if ( max_count() <= neighbors.size() && in operator ()()
[all …]
/third_party/boost/boost/graph/distributed/
Dfruchterman_reingold.hpp175 int neighbors[4] = { -1, -1, -1, -1 } ; in operator ()() local
177 neighbors[left] = tiling(my_tile.first - 1, my_tile.second); in operator ()()
179 neighbors[top] = tiling(my_tile.first, my_tile.second - 1); in operator ()()
181 neighbors[right] = tiling(my_tile.first + 1, my_tile.second); in operator ()()
183 neighbors[bottom] = tiling(my_tile.first, my_tile.second + 1); in operator ()()
196 if (neighbors[pos] != -1) { in operator ()()
197 send(pg, neighbors[pos], 0, my_vertices[pos].size()); in operator ()()
199 send(pg, neighbors[pos], 1, in operator ()()
209 if (neighbors[pos] != -1) { in operator ()()
211 receive(pg, neighbors[pos], 0, incoming_vertices); in operator ()()
[all …]
/third_party/ffmpeg/tests/checkasm/
Dh264pred.c211 int neighbors; in check_pred8x8l() local
212 for (neighbors = 0; neighbors <= 0xc000; neighbors += 0x4000) { in check_pred8x8l()
213 int has_topleft = neighbors & 0x8000; in check_pred8x8l()
214 int has_topright = neighbors & 0x4000; in check_pred8x8l()
/third_party/mesa3d/src/gallium/auxiliary/gallivm/
Dlp_bld_sample_aos.c576 LLVMValueRef neighbors[2][2][2]; /* [z][y][x] */ in lp_build_sample_fetch_image_linear() local
681 neighbors[k][j][i] = rgba8; in lp_build_sample_fetch_image_linear()
697 &neighbors[0][0][0], in lp_build_sample_fetch_image_linear()
698 &neighbors[0][0][1], in lp_build_sample_fetch_image_linear()
707 &neighbors[0][0][0], in lp_build_sample_fetch_image_linear()
708 &neighbors[0][0][1], in lp_build_sample_fetch_image_linear()
709 &neighbors[0][1][0], in lp_build_sample_fetch_image_linear()
710 &neighbors[0][1][1], in lp_build_sample_fetch_image_linear()
720 &neighbors[0][0][0], in lp_build_sample_fetch_image_linear()
721 &neighbors[0][0][1], in lp_build_sample_fetch_image_linear()
[all …]
Dlp_bld_sample_soa.c1040 LLVMValueRef neighbors[2][2][4]; in lp_build_sample_image_linear() local
1353 data_ptr, mipoffsets, neighbors[0][0]); in lp_build_sample_image_linear()
1358 data_ptr, mipoffsets, neighbors[0][1]); in lp_build_sample_image_linear()
1368 neighbors[0][0], in lp_build_sample_image_linear()
1369 neighbors[0][1], in lp_build_sample_image_linear()
1374 cmpval0 = lp_build_sample_comparefunc(bld, coords[4], neighbors[0][0][0]); in lp_build_sample_image_linear()
1375 cmpval1 = lp_build_sample_comparefunc(bld, coords[4], neighbors[0][1][0]); in lp_build_sample_image_linear()
1392 data_ptr, mipoffsets, neighbors[1][0]); in lp_build_sample_image_linear()
1397 data_ptr, mipoffsets, neighbors[1][1]); in lp_build_sample_image_linear()
1474 neighbors[0][0][chan]); in lp_build_sample_image_linear()
[all …]
/third_party/boost/libs/graph/example/
Dedge-connectivity.cpp45 void neighbors(const Graph& g, in neighbors() function
53 void neighbors(const Graph& g, VertexIterator first, VertexIterator last, in neighbors() function
57 neighbors(g, *first, result); in neighbors()
113 neighbors( in edge_connectivity()
134 neighbors(g, k, std::inserter(neighbor_S, neighbor_S.begin())); in edge_connectivity()
/third_party/boost/libs/graph/doc/
Dminimum_degree_ordering.w155 put all numbered adjacent vertices into the temporary neighbors stack
170 neighbors->push(id[v]);
185 while (!neighbors.empty()) {
186 size_type n_id = neighbors.top();
196 neighbors.pop();
/third_party/skia/third_party/externals/tint/test/bug/tint/
D942.wgsl25 // results since not all of the neighbors are available in shared memory.
/third_party/boost/libs/graph_parallel/doc/
Dboman_et_al_graph_coloring.rst104 will be sent to their out-of-process neighbors. Smaller values
113 colors of its neighbors. The function object will be passed a vector
/third_party/skia/third_party/externals/opengl-registry/extensions/ARB/
DARB_derivative_control.txt182 current fragment's neighbors, and will possibly, but not necessarily,
191 current fragment's neighbors, and will possibly, but not necessarily,
/third_party/openGLES/extensions/ARB/
DARB_derivative_control.txt192 current fragment's neighbors, and will possibly, but not necessarily,
201 current fragment's neighbors, and will possibly, but not necessarily,
/third_party/ffmpeg/libavfilter/
Daf_sofalizer.c692 int *neighbors; in getfilter_float() local
701 neighbors = mysofa_neighborhood(s->sofa.neighborhood, nearest); in getfilter_float()
703 nearest, neighbors, in getfilter_float()
/third_party/boost/libs/gil/doc/tutorial/
Dgradient.rst21 edges of the image for which one of the neighbors is not defined. The focus of
111 neighbors. ``operator()`` returns a reference to a grayscale pixel.
199 want to access its neighbors above and below it. Such relative access can be
240 though that the offset of the two neighbors is the same, regardless of
561 iterators to access the two neighbors properly, since they could
572 the horizontal neighbors of the corresponding source pixel. If we
597 pixel neighbors through the passed locators. GIL algorithms iterate
/third_party/boost/libs/gil/doc/html/_sources/tutorial/
Dgradient.rst.txt21 edges of the image for which one of the neighbors is not defined. The focus of
111 neighbors. ``operator()`` returns a reference to a grayscale pixel.
199 want to access its neighbors above and below it. Such relative access can be
240 though that the offset of the two neighbors is the same, regardless of
561 iterators to access the two neighbors properly, since they could
572 the horizontal neighbors of the corresponding source pixel. If we
597 pixel neighbors through the passed locators. GIL algorithms iterate
/third_party/boost/libs/gil/doc/design/
Dpixel_locator.rst245 above=loc.cache_location(0,-1); // remember relative locations of neighbors above and below
259 neighbors for every pixel in the image, in which case the relative positions
/third_party/boost/libs/gil/doc/html/_sources/design/
Dpixel_locator.rst.txt245 above=loc.cache_location(0,-1); // remember relative locations of neighbors above and below
259 neighbors for every pixel in the image, in which case the relative positions

12