Home
last modified time | relevance | path

Searched refs:maximum_matching (Results 1 – 5 of 5) sorted by relevance

/external/rust/android-crates-io/crates/petgraph/benches/
Dmatching.rs12 use petgraph::algo::{greedy_matching, maximum_matching};
59 bench.iter(|| maximum_matching(&g)); in maximum_matching_bipartite()
65 bench.iter(|| maximum_matching(&g)); in maximum_matching_full()
71 bench.iter(|| maximum_matching(&g)); in maximum_matching_bigger()
77 bench.iter(|| maximum_matching(&g)); in maximum_matching_huge()
/external/rust/android-crates-io/crates/petgraph/tests/
Dmatching.rs4 use petgraph::algo::{greedy_matching, maximum_matching};
85 let m = maximum_matching(&g); in maximum_empty()
93 let m = maximum_matching(&g); in maximum_disjoint()
101 let m = maximum_matching(&g); in maximum_odd_path()
116 let m = maximum_matching(&g); in maximum_in_stable_graph()
138 let m = maximum_matching(&g); in is_perfect_in_stable_graph()
Dquickcheck.rs28 is_isomorphic, is_isomorphic_matching, k_shortest_path, kosaraju_scc, maximum_matching,
1291 let m2 = maximum_matching(&g);
1304 let m2 = maximum_matching(&g);
/external/rust/android-crates-io/crates/petgraph/src/algo/
Dmatching.rs368 pub fn maximum_matching<G>(graph: G) -> Matching<G> in maximum_matching() function
Dmod.rs46 pub use matching::{greedy_matching, maximum_matching, Matching};