Package graphmatcher.graph

Examples of graphmatcher.graph.Edge

166
167
168
169
170
171
172
173
174
175
176
177
    return match1on1;
  }

  private static boolean match1On1(Graph pattern, Graph template, int patternEdgeID, int templateEdgeID,
      boolean noRotation) {
    Edge patternEdge = pattern.virtualEdges()[patternEdgeID];
    Edge templateEdge = template.virtualEdges()[templateEdgeID];
    Point pV1 = pattern.vertices()[patternEdge.vertex1].toPoint();
    Point pV2 = pattern.vertices()[patternEdge.vertex2].toPoint();
    Point tV1 = template.vertices()[templateEdge.vertex1].toPoint();
    Point tV2 = template.vertices()[templateEdge.vertex2].toPoint();
View Full Code Here
379
380
381
382
383
384
385
386
387
388
389
390
    }
    return false;
  }

  public static boolean similarEdges(Graph graph, int edgeID1, int edgeID2, boolean v1Tov1) {
    Edge edge1 = graph.virtualEdges()[edgeID1];
    Edge edge2 = graph.virtualEdges()[edgeID2];

    Vertex vertex1_1 = graph.vertices()[edge1.vertex1];
    Vertex vertex1_2 = graph.vertices()[edge1.vertex2];
    Vertex vertex2_1 = graph.vertices()[edge2.vertex1];
    Vertex vertex2_2 = graph.vertices()[edge2.vertex2];
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
    Set<Integer> keys = matching.keySet();

    Iterator<Integer> iter = keys.iterator();
    while (iter.hasNext()) {
      int patternEdgeID = iter.next();
      Edge patternEdge = pattern.virtualEdges()[patternEdgeID];
      result += patternEdge + "->(";
      Vector<Integer> templateEdgeIDs = matching.get(patternEdgeID);
      for (int i = 0; i < templateEdgeIDs.size(); i++) {
        Edge templateEdge = template.virtualEdges()[templateEdgeIDs.get(i)];
        result += templateEdge;
        if (i < templateEdgeIDs.size() - 1) {
          result += "|";
        }
      }
View Full Code Here
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
          int pEdgeID2 = pEdges2.get(j);
          if (candidate1.isInSubMatching(pEdgeID2)) {
            break;
          }
          int tEdgeID2 = matching2.get(pEdgeID2).firstElement();
          Edge pEdge1 = pattern.virtualEdges()[pEdgeID1];
          // System.out.println("pedge1: " + pEdge1);
          // for (Edge subEdge : pEdge1.subEdges) {
          // System.out.println(subEdge);
          // }
          Edge tEdge1 = template.virtualEdges()[tEdgeID1];
          Edge pEdge2 = pattern.virtualEdges()[pEdgeID2];
          // System.out.println("pedge2: " + pEdge2);
          // for (Edge subEdge : pEdge2.subEdges) {
          // System.out.println(subEdge);
          // }
          Edge tEdge2 = template.virtualEdges()[tEdgeID2];
          double rating = EdgeRater.rateMatchingPair(pattern, template, pEdgeID1, tEdgeID1,
              pEdgeID2, tEdgeID2, candidate1.match1on1);
          logger.debug(pEdge1 + "->" + tEdge1 + " <---> " + pEdge2 + "->" + tEdge2 + " Rating: "
              + rating);
          if (rating < minimumRatingForGoodPair) {
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
300
301
  }

  private LinkedHashMap<Integer, Vector<Integer>> computeSubMatching(Graph pattern, Graph template,
      int patternEdgeID, int templateEdgeID, boolean[][] match1on1) {
    LinkedHashMap<Integer, Vector<Integer>> result = new LinkedHashMap<Integer, Vector<Integer>>();
    Edge patternEdge = pattern.virtualEdges()[patternEdgeID];

    matchedEdges.addAll(patternEdge.getOriginalEdges());

    // FIXME: submatching ermitteln

    // Vector<Edge> patternSubEdges = getAllSubEdges(patternEdge);
    // patternSubEdges.remove(patternEdge);
View Full Code Here
310
311
312
313
314
315
316
317
318
319
320
321
    return result;
  }

  public boolean isInSubMatching(int patternEdgeID) {
    Edge edge = pattern.virtualEdges()[patternEdgeID];
    for (Edge subEdge : edge.getOriginalEdges()) {
      if (!matchedEdges.contains(subEdge)) {
        return false;
      }
    }
    return true;
View Full Code Here
TOP

Related Classes of graphmatcher.graph.Edge

  • graphmatcher.gui.GraphPanel
  • graphmatcher.helper.GraphTools
  • graphmatcher.matcher.AbstractMatcher
  • graphmatcher.matcher.komatcher.Candidate
  • graphmatcher.matcher.komatcher.CandidateBundle
  • graphmatcher.matcher.komatcher.EdgeRater
  • graphmatcher.matcher.komatcher.KOSystemGraphMatcher
  • graphmatcher.matcher.MatchingResult
  • java.text.NumberFormat
    • Copyright © 2018 www.massapicom. 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.