Ejemplo n.º 1
0
  /**
   * gets the ambiguous paths: we have an ambiguous path where there is more than one path that
   * connects two entities.
   *
   * @return the ambiguous paths. If there is no ambiguous path the set is empty
   */
  private Set<EntitiesPath> getAmbiguousEntitiesPaths() {
    logger.debug("IN: finding the ambiguous paths");
    Set<EntitiesPath> ambiguouPaths = new HashSet<EntitiesPath>();
    if (paths != null) {
      logger.debug("Checking if there is more than one path between all the connected entities");
      Iterator<EntitiesPath> iter = paths.iterator();

      while (iter.hasNext()) {
        EntitiesPath path = iter.next();
        if (path.getPaths() != null && path.getPaths().size() > 1) {
          ambiguouPaths.add(path);
        }
      }
    }
    logger.debug("OUT");
    return ambiguouPaths;
  }