Home
last modified time | relevance | path

Searched defs:IntoNeighbors (Results 1 – 7 of 7) sorted by relevance

/aosp_15_r20/external/rust/android-crates-io/crates/petgraph/src/algo/
Dmatching.rs207 G: Visitable + IntoNodeIdentifiers + NodeIndexable + IntoNeighbors, in greedy_matching()
218 G: Visitable + IntoNodeIdentifiers + NodeIndexable + IntoNeighbors, in greedy_matching_inner()
246 G: Visitable + IntoNeighbors, in non_backtracking_dfs()
/aosp_15_r20/external/rust/android-crates-io/crates/petgraph/src/visit/
Dfilter.rs93 impl<'a, G, F> IntoNeighbors for &'a NodeFiltered<G, F> impl
400 impl<'a, G, F> IntoNeighbors for &'a EdgeFiltered<G, F> impl
Dmod.rs115 pub trait IntoNeighbors : GraphRef { trait
/aosp_15_r20/external/rust/android-crates-io/crates/petgraph/tests/
Dquickcheck.rs1115 G: Visitable + IntoNodeIdentifiers + IntoNeighbors, in naive_closure()
1124 G: Visitable + IntoNodeIdentifiers + IntoNeighbors, in naive_closure_edgecount()
Dgraph.rs1763 fn degree<'a, G>(g: G, node: G::NodeId) -> usize in degree()
/aosp_15_r20/external/rust/android-crates-io/crates/petgraph/src/
Dadj.rs465 impl<'a, E, Ix: IndexType> IntoNeighbors for &'a List<E, Ix> { impl
Dcsr.rs611 impl<'a, N, E, Ty, Ix> IntoNeighbors for &'a Csr<N, E, Ty, Ix> impl