Examples of minCostCavityMatching()

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

166
167
168
169
170
171
172
173
174
175
176
    matcher.setMatchCost(4, 1, -1);
    matcher.setMatchCost(6, 3, -1);

    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();
View Full Code Here

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

194
195
196
197
198
199
200
201
202
203
204
    matcher.setMatchCost(6, 3, -1);

    matcher.setMatchCost(5, 2, 3);

    Assert.assertEquals("Cavity matching answer is wrong", 13,
        matcher.minCostCavityMatching(7, 5), 0.001);

    TIntArrayList[] matching = matcher.getCavityMatching(7, 5);
    IntPairComparator comp = new IntPairComparator();

    ArrayList<IntPair> ans = new ArrayList<IntPair>();
View Full Code Here

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

165
166
167
168
169
170
171
172
173
174
175
    int sFromNeighborIx = s.getNeighborIx(sTo, sFrom);

    BipartiteCavityMatcher matcher = matchers[tTo][sTo];

    if (MathOperations.equals(cost,
        matcher.minCostCavityMatching(tFromNeighborIx, sFromNeighborIx)
            + costFunction.cost(t.labels[tTo], s.labels[sTo]))) {
      alignment[0].add(tTo);
      alignment[1].add(sTo);
      alignment[2].add(nextGroupIx);
View Full Code Here

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

166
167
168
169
170
171
172
173
174
175
176
    matcher.setMatchCost(4, 1, -1);
    matcher.setMatchCost(6, 3, -1);

    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();
View Full Code Here

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

194
195
196
197
198
199
200
201
202
203
204
    matcher.setMatchCost(6, 3, -1);

    matcher.setMatchCost(5, 2, 3);

    Assert.assertEquals("Cavity matching answer is wrong", 13,
        matcher.minCostCavityMatching(7, 5), 0.001);

    TIntArrayList[] matching = matcher.getCavityMatching(7, 5);
    IntPairComparator comp = new IntPairComparator();

    ArrayList<IntPair> ans = new ArrayList<IntPair>();
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.