Home
last modified time | relevance | path

Searched defs:Directed (Results 1 – 9 of 9) sorted by relevance

/external/guava/guava/src/com/google/common/graph/
DEndpointPairIterator.java72 private static final class Directed<N> extends EndpointPairIterator<N> { class in EndpointPairIterator
73 private Directed(BaseGraph<N> graph) { in Directed() method in EndpointPairIterator.Directed
/external/guava/android/guava/src/com/google/common/graph/
DEndpointPairIterator.java72 private static final class Directed<N> extends EndpointPairIterator<N> { class in EndpointPairIterator
73 private Directed(BaseGraph<N> graph) { in Directed() method in EndpointPairIterator.Directed
/external/rust/android-crates-io/crates/petgraph/src/
Dlib.rs206 pub enum Directed {} enum
217 impl EdgeType for Directed { implementation
Dmatrix_graph.rs541 ) -> Neighbors<Directed, Null, Ix> { in neighbors_directed()
560 pub fn edges_directed(&self, a: NodeIndex<Ix>, d: Direction) -> Edges<Directed, Null, Ix> { in edges_directed()
/external/rust/android-crates-io/crates/petgraph/benches/
Dgraphmap.rs34 ) -> GraphMap<&MyStruct, usize, Directed, H> { in test_graph() argument
/external/rust/android-crates-io/crates/petgraph/tests/
Diso.rs230 fn str_to_digraph(s: &str) -> Graph<(), (), Directed> { in str_to_digraph() argument
235 fn graph_from_file(path: &str) -> Graph<(), (), Directed> { in graph_from_file() argument
Dquickcheck.rs630 fn is_topo_order<N>(gr: &Graph<N, (), Directed>, order: &[NodeIndex]) -> bool { in is_topo_order() argument
653 fn subset_is_topo_order<N>(gr: &Graph<N, (), Directed>, order: &[NodeIndex]) -> bool { in subset_is_topo_order() argument
Dgraph.rs677 fn assert_is_topo_order<N, E>(gr: &Graph<N, E, Directed>, order: &[NodeIndex]) { in assert_is_topo_order() argument
/external/rust/android-crates-io/crates/petgraph/src/graph_impl/
Dserialization.rs124 Directed, enumerator