Examples of minCostMatching()


Examples of bgu.bio.algorithms.graphs.hsa.matchers.BipartiteCavityMatcher.minCostMatching()

    matcher.setMatchCost(5, 2, 3);

    boolean res = matcher.minCostCavityMatching(7, 5) == 13;
    System.out.println("Cavity matching test: " + res);

    res = matcher.minCostMatching() == 7;
    System.out.println("Full matching test: " + res);
    TIntArrayList[] matching = matcher.getCurrMatching();

    System.out.println("Current matching:");
    for (int i = 0; i < matching[0].size(); ++i) {
View Full Code Here

Examples of bgu.bio.algorithms.graphs.hsa.matchers.BipartiteCavityMatcher.minCostMatching()

    Collections.sort(exp, comp);

    isSame(ans, exp);

    Assert.assertEquals("Minimum matching answer is wrong", 7,
        matcher.minCostMatching(), 0.001);

    ans = new ArrayList<IntPair>();
    exp = new ArrayList<IntPair>();

    matching = matcher.getCurrMatching();
View Full Code Here

Examples of bgu.bio.algorithms.graphs.hsa.matchers.BipartiteCavityMatcher.minCostMatching()

        alignment[1].add(sRoot);
        alignment[2].add(0);

        BipartiteCavityMatcher matcher = matchers[tRoot][sRoot];
        matcher.setMinCostFullMatching(Double.NaN);
        matcher.minCostMatching();
        TIntArrayList[] matching = matcher.getCurrMatching();

        int nextGroupId = 1;
        for (int pair = 0; pair < matching[0].size(); ++pair) {
          nextGroupId = traceback(t, s, alignment, tRoot,
View Full Code Here

Examples of bgu.bio.algorithms.graphs.hsa.matchers.OrderedBipartiteCavityMatcher.minCostMatching()

    matcher.setMatchCost(5, 2, 3);

    boolean res = matcher.minCostCavityMatching(7, 5) == 13;
    System.out.println("Cavity matching test: " + res);

    res = matcher.minCostMatching() == 7;
    System.out.println("Full matching test: " + res);
    TIntArrayList[] matching = matcher.getCurrMatching();

    System.out.println("Current matching:");
    for (int i = 0; i < matching[0].size(); ++i) {
View Full Code Here

Examples of bgu.bio.algorithms.graphs.hsa.matchers.OrderedBipartiteCavityMatcher.minCostMatching()

    Collections.sort(exp, comp);

    isSame(ans, exp);

    Assert.assertEquals("Minimum matching answer is wrong", 7,
        matcher.minCostMatching(), 0.001);

    ans = new ArrayList<IntPair>();
    exp = new ArrayList<IntPair>();

    matching = matcher.getCurrMatching();
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.