Home
last modified time | relevance | path

Searched refs:depth_first_search (Results 1 – 11 of 11) sorted by relevance

/external/sdv/vsomeip/third_party/boost/parameter/test/literate/
Ddefault-expression-evaluation0.cpp13 BOOST_PARAMETER_FUNCTION((bool), depth_first_search, tag, in BOOST_PARAMETER_NAME()
41 depth_first_search(1, 2, 3, 4, 5); in main()
42 depth_first_search( in main()
Dpredicate-requirements0.cpp140 BOOST_PARAMETER_FUNCTION((void), depth_first_search, graphs,
185 ::depth_first_search(g); in main()
186 ::depth_first_search(g, _root_vertex = static_cast<std::size_t>(x)); in main()
Dwriting-the-function0.cpp26 depth_first_search, // 2. name of the function template
/external/sdv/vsomeip/third_party/boost/parameter/test/
Dtutorial.cpp22 void depth_first_search(ArgumentPack const& args) in depth_first_search() function
36 core::depth_first_search(( in main()
/external/sdv/vsomeip/third_party/boost/parameter/doc/
Dindex.rst290 .. _dfs: ../../../graph/doc/depth_first_search.html
292 .. |dfs| replace:: ``depth_first_search``
338 depth_first_search(
354 .. table:: ``depth_first_search`` Parameters
403 ``depth_first_search`` with named arguments, leaving out any
408 graphs::depth_first_search(g, **color_map_=my_color_map**);
487 depth_first_search, // 2. name of the function template
567 Since ``depth_first_search`` doesn't require any particular type for its
724 graphs::depth_first_search(x, y);
760 with our code so far by replacing the body of ``depth_first_search`` with
[all …]
/external/rust/android-crates-io/crates/petgraph/src/visit/
Ddfsvisit.rs247 pub fn depth_first_search<G, I, F, C>(graph: G, starts: I, mut visitor: F) -> C in depth_first_search() function
/external/rust/android-crates-io/crates/petgraph/src/algo/
Dmod.rs202 use crate::visit::{depth_first_search, DfsEvent}; in is_cyclic_directed()
204 depth_first_search(g, g.node_identifiers(), |event| match event { in is_cyclic_directed()
/external/rust/android-crates-io/crates/parking_lot_core/src/
Dparking_lot.rs1402 use petgraph::visit::depth_first_search; in graph_cycles()
1413 depth_first_search(g, threads, |e| match e { in graph_cycles()
/external/rust/android-crates-io/crates/petgraph/tests/
Dgraph.rs2037 use petgraph::visit::{depth_first_search, Time}; in dfs_visit()
2056 depth_first_search(&gr, Some(n(0)), |evt| { in dfs_visit()
2094 let ret = depth_first_search(&gr, Some(start), |event| { in dfs_visit()
2121 let ret = depth_first_search(&gr, Some(start), |event| { in dfs_visit()
Dquickcheck.rs877 use petgraph::visit::{Time, depth_first_search};
888 depth_first_search(&gr, Some(start_node).into_iter().chain(gr.node_indices()),
/external/rust/android-crates-io/crates/petgraph/
DRELEASES.rst369 - Add ``depth_first_search``, a recursive dfs visitor that emits discovery,