Home
last modified time | relevance | path

Searched refs:Graph (Results 1 - 5 of 5) sorted by relevance

/foundation/distributeddatamgr/udmf/framework/common/
H A Dgraph.cpp15 #define LOG_TAG "Graph"
20 Graph::Graph(uint32_t vertexNum, const std::map<std::string, uint32_t> &typeIdIndex) in Graph() function in OHOS::UDMF::Graph
30 Graph::~Graph() in ~Graph()
42 void Graph::AddEdge(const std::string &startNode, const std::string &endNode) in AddEdge()
54 void Graph::AddEdge(uint32_t start, uint32_t end) in AddEdge()
62 bool Graph::Dfs(uint32_t startNode, Action action, bool isInit) in Dfs()
97 bool Graph::DfsUnconnectedGraph(Action action) in DfsUnconnectedGraph()
111 bool Graph
[all...]
H A Dutd_graph.h36 std::unique_ptr<Graph> ConstructNewGraph(const std::vector<TypeDescriptorCfg> &descriptorCfgs);
37 void Update(std::unique_ptr<Graph> graph);
44 std::unique_ptr<Graph> graph_;
H A Dgraph.h36 class Graph { class
38 explicit Graph(uint32_t vertexNum, const std::map<std::string, uint32_t> &typeIdIndex);
39 ~Graph();
H A Dutd_graph.cpp49 graph_ = std::make_unique<Graph>(descriptorsNum, typeIdIndex); in InitUtdGraph()
80 std::unique_ptr<Graph> UtdGraph::ConstructNewGraph(const std::vector<TypeDescriptorCfg> &descriptorCfgs) in ConstructNewGraph()
87 auto graph = std::make_unique<Graph>(descriptorsNum, typeIdIndex); in ConstructNewGraph()
98 void UtdGraph::Update(std::unique_ptr<Graph> graph) in Update()
/foundation/distributeddatamgr/udmf/framework/innerkitsimpl/test/unittest/
H A Dgraph_test.cpp73 Graph graph(vextexNum, {}); in HWTEST_F()
95 Graph graph(vextexNum, {}); in HWTEST_F()
118 Graph graph(vextexNum, {}); in HWTEST_F()
141 Graph graph(vextexNum, {}); in HWTEST_F()
171 Graph graph(vextexNum, {}); in HWTEST_F()
200 Graph graph(vextexNum, {}); in HWTEST_F()
226 Graph graph(vextexNum, {}); in HWTEST_F()
252 Graph graph(vextexNum, {}); in HWTEST_F()
281 Graph graph(vextexNum, {}); in HWTEST_F()
334 Graph grap in HWTEST_F()
[all...]

Completed in 3 milliseconds