Searched refs:BFS (Results 1 – 10 of 10) sorted by relevance
/third_party/boost/libs/graph_parallel/doc/ |
D | breadth_first_search.rst | 26 traversal of a directed or undirected graph. The distributed BFS is 35 in a given level of the BFS tree will be processed (potentially in 62 The visitor must be a distributed BFS visitor. The suble differences 63 between sequential and distributed BFS visitors are discussed in the 77 again (as is typical for BFS), the queue must filter duplicates 95 The `BFS Visitor`_ concept defines 9 event points that will be 97 BFS retains these nine event points, but the sequence of events 126 sequential BFS, this event may be triggered even when the target has 128 ``non_tree_edge`` events in a sequential BFS may become 129 ``tree_edge`` in a distributed BFS. [all …]
|
/third_party/boost/libs/graph/example/ |
D | visitor.expected | 12 BFS categorized directed graph
|
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/auto_parallel/ |
D | graph_costmodel.h | 56 void BFS(const OperatorInfoPtr &, const StrategyPtr &, std::map<OperatorInfoPtr, StrategyPtr>,
|
D | graph_costmodel.cc | 100 BFS(op_stra.first, op_stra.second, ops_stras, &visited); in StrategyPropagate() 117 void CostGraph::BFS(const OperatorInfoPtr &op, const StrategyPtr &op_stra, in BFS() function in mindspore::parallel::CostGraph
|
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/opt/ |
D | pass.h | 122 enum Order { DFS, BFS }; enumerator
|
D | pass.cc | 77 } else if (traversalOrder_ == Order::BFS) { in Run()
|
/third_party/boost/libs/graph/doc/ |
D | isomorphism-impl-v3.w | 59 % Ideas: use BFS instead of DFS, don't have to sort edges? 65 %\vizfig{iso-eg2}{Vertices numbered by BFS discover time. The BFS tree 66 %edges are the solid lines. Nodes $0$ and $5$ are BFS tree root nodes.} 69 % would be the BFS discover time of the target vertex.
|
/third_party/libxml2/macos/ |
D | libxml2.mcp.xml.sit.hqx | 140 +HD5HI@BFS@lI',mkFU%)hTXZK#8`5b'LD'-5ULKi*X,30-q`BGq1@UZ"U$+lia'
|
/third_party/gptfdisk/ |
D | NEWS | 511 - Added partition type code for Haiku BFS (GUID
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
D | PPCISelLowering.cpp | 12051 int BFS = MFI.getObjectSize(BFI); in isConsecutiveLSLoc() local 12052 if (FS != BFS || FS != (int)Bytes) return false; in isConsecutiveLSLoc()
|