Home
last modified time | relevance | path

Searched defs:node_list (Results 1 – 25 of 107) sorted by relevance

12345

/third_party/mindspore/mindspore/ccsrc/minddata/dataset/api/python/bindings/dataset/engine/gnn/
Dbindings.cc60 … [](gnn::GraphData &g, const std::vector<std::pair<gnn::NodeIdType, gnn::NodeIdType>> &node_list) { in __anone4a0376a0102()
67 OutputFormat format) { in __anone4a0376a0102()
80 … [](gnn::GraphData &g, std::vector<gnn::NodeIdType> node_list, gnn::NodeIdType neighbor_num, in __anone4a0376a0102()
81 gnn::NodeType neg_neighbor_type) { in __anone4a0376a0102()
87 …[](gnn::GraphData &g, std::shared_ptr<Tensor> node_list, std::vector<gnn::FeatureType> feature_typ… in __anone4a0376a0102()
106 float step_home_param, float step_away_param, gnn::NodeIdType default_node) { in __anone4a0376a0102()
/third_party/mindspore/mindspore/dataset/engine/
Dgraphdata.py181 def get_edges_from_nodes(self, node_list): argument
202 def get_all_neighbors(self, node_list, neighbor_type, output_format=OutputFormat.NORMAL): argument
328 …def get_sampled_neighbors(self, node_list, neighbor_nums, neighbor_types, strategy=SamplingStrateg… argument
369 def get_neg_sampled_neighbors(self, node_list, neg_neighbor_num, neg_neighbor_type): argument
397 def get_node_feature(self, node_list, feature_types): argument
/third_party/mindspore/tests/ut/cpp/pre_activate/pass/
Dallreduce_fusion_test.cc60 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
101 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
142 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
199 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
/third_party/mindspore/tests/ut/cpp/dataset/
Dgnn_graph_test.cc127 std::vector<NodeIdType> node_list; in TEST_F() local
168 std::vector<NodeIdType> node_list; in TEST_F() local
229 std::vector<NodeIdType> node_list; in TEST_F() local
331 std::vector<NodeIdType> node_list; in TEST_F() local
373 std::vector<NodeIdType> node_list; in TEST_F() local
399 std::vector<NodeIdType> node_list; in TEST_F() local
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/gpu/
Dcombine_momentum_fusion.cc24 bool GetDealList(const std::vector<AnfNodePtr> &node_list, std::vector<std::vector<AnfNodePtr>> *de… in GetDealList()
52 std::vector<AnfNodePtr> node_list = TopoSort(graph->get_return()); in Run() local
Dcombine_cast_fusion.cc25 bool GetDealList(const std::vector<AnfNodePtr> &node_list, std::vector<std::vector<AnfNodePtr>> *de… in GetDealList()
82 std::vector<AnfNodePtr> node_list = TopoSort(graph->get_return()); in Run() local
/third_party/mindspore/mindspore/lite/test/ut/tools/converter/registry/
Dpass_registry_test.cc101 auto node_list = api::FuncGraph::TopoSort(func_graph->get_return()); in Execute() local
169 auto node_list = TopoSort(func_graph->get_return()); in Execute() local
210 auto node_list = api::FuncGraph::TopoSort(func_graph_->get_return()); in TEST_F() local
Dmodel_parser_registry_test.cc43 auto node_list = func_graph->TopoSort(func_graph->get_return()); in TEST_F() local
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/gnn/
Dgraph_data_service_impl.cc197 std::vector<std::pair<NodeIdType, NodeIdType>> node_list; in GetEdgesFromNodes() local
219 std::vector<NodeIdType> node_list; in GetAllNeighbors() local
238 std::vector<NodeIdType> node_list; in GetSampledNeighbors() local
264 std::vector<NodeIdType> node_list; in GetNegSampledNeighbors() local
280 std::vector<NodeIdType> node_list; in RandomWalk() local
/third_party/mindspore/tests/ut/cpp/pre_activate/ascend/format_type/
Dinsert_cast_test.cc72 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
126 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
/third_party/mindspore/mindspore/lite/tools/optimizer/graph/
Dsplit_one_pass.cc30 auto node_list = TopoSort(func_graph->get_return()); in Run() local
Dreduce_same_act_pass.cc30 auto node_list = TopoSort(func_graph->get_return()); in Run() local
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/buffer_fusion/
Dmatmul_confusiontranspose_fusion_pass.cc49 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dconv_bnreduce_fusion_pass.cc47 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dconv2dbackprop_eltwise_fusion_pass.cc50 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dbatchmatmul_fusedmuladd_fusion_pass.cc45 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dmatmul_eltwise_fusion_pass.cc46 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Deltwise_fusion_pass.cc57 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dconv_single_in_fusion_pass.cc60 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dmulti_output_fusion_pass.cc63 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dconv_double_in_fusion_pass.cc56 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dbnupdate_eltwise_fusion_pass.cc50 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
Dstridedread_conv_stridedwrite_fusion_pass.cc67 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/ir_fusion/
Drefresh_parameter_format.cc51 std::vector<AnfNodePtr> node_list = TopoSort(func_graph->get_return()); in Run() local
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/enhancer/
Dinsert_depend_for_all_gather.cc26 std::vector<AnfNodePtr> node_list = TopoSort(graph->get_return()); in Run() local

12345