Esempio n. 1
0
  @Test
  public void testGetConfigArray1() {
    Var v0 = getVar(0, 2);
    Var v1 = getVar(1, 3);
    Var v2 = getVar(2, 5);

    VarSet vars1 = new VarSet();
    vars1.add(v0);
    vars1.add(v1);
    vars1.add(v2);

    VarSet vars2 = new VarSet();
    vars2.add(v1);
    vars2.add(v2);

    int[] configs = vars2.getConfigArr(vars1);
    System.out.println(Arrays.toString(configs));
    assertEquals(2 * 3 * 5, configs.length);
    Assert.assertArrayEquals(
        new int[] {
          0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13,
          13, 14, 14
        },
        configs);
  }
Esempio n. 2
0
  @Test
  public void testGetNumConfigs() {
    Var v0 = getVar(0, 2);
    Var v1 = getVar(1, 3);
    Var v2 = getVar(2, 5);

    VarSet vars = new VarSet();
    vars.add(v0);
    vars.add(v1);
    vars.add(v2);

    assertEquals(2 * 3 * 5, vars.calcNumConfigs());
  }
Esempio n. 3
0
  @Test
  public void testGetConfigArray2Swapped() {
    Var v0 = getVar(0, 2);
    Var v1 = getVar(1, 3);
    Var v2 = getVar(2, 5);

    VarSet vars1 = new VarSet();
    vars1.add(v0);
    vars1.add(v1);
    vars1.add(v2);

    VarSet vars2 = new VarSet();
    vars2.add(v0);
    vars2.add(v2);

    System.out.println(new DenseFactor(vars1));

    // TODO: we can't loop over a particular configuration of vars1, only the config in which each
    // (non-vars2) variable has state 0.
    int[] configs = vars1.getConfigArr(vars2);
    System.out.println(Arrays.toString(configs));
    assertEquals(2 * 5, configs.length);
    Assert.assertArrayEquals(new int[] {0, 1, 6, 7, 12, 13, 18, 19, 24, 25}, configs);
  }
  /** Adds edges to graph until it is triangulated. */
  private void triangulate(final UndirectedGraph mdl) {
    UndirectedGraph mdl2 = dupGraph(mdl);
    ArrayList<Variable> vars = new ArrayList<Variable>(mdl.vertexSet());
    Alphabet<Variable> varMap = makeVertexMap(vars);
    cliques = new ArrayList();

    // debug
    if (logger.isLoggable(Level.FINER)) {
      logger.finer("Triangulating model: " + mdl);
      String ret = "";
      for (int i = 0; i < vars.size(); i++) {
        Variable next = (Variable) vars.get(i);
        ret += next.toString() + "\n"; // " (" + mdl.getIndex(next) + ")\n  ";
      }
      logger.finer(ret);
    }

    while (!vars.isEmpty()) {
      Variable v = (Variable) pickVertexToRemove(mdl2, vars);
      logger.finer("Triangulating vertex " + v);

      VarSet varSet = new BitVarSet(v.getUniverse(), GraphHelper.neighborListOf(mdl2, v));
      varSet.add(v);
      if (!findSuperClique(cliques, varSet)) {
        cliques.add(varSet);
        if (logger.isLoggable(Level.FINER)) {
          logger.finer(
              "  Elim clique " + varSet + " size " + varSet.size() + " weight " + varSet.weight());
        }
      }

      // must remove V from graph first, because adding the edges
      //  will change the rating of other vertices

      connectNeighbors(mdl2, v);
      vars.remove(v);
      mdl2.removeVertex(v);
    }

    if (logger.isLoggable(Level.FINE)) {
      logger.fine("Triangulation done. Cliques are: ");
      int totSize = 0, totWeight = 0, maxSize = 0, maxWeight = 0;
      for (Iterator it = cliques.iterator(); it.hasNext(); ) {
        VarSet c = (VarSet) it.next();
        logger.finer(c.toString());
        totSize += c.size();
        maxSize = Math.max(c.size(), maxSize);
        totWeight += c.weight();
        maxWeight = Math.max(c.weight(), maxWeight);
      }
      double sz = cliques.size();
      logger.fine(
          "Jt created "
              + sz
              + " cliques. Size: avg "
              + (totSize / sz)
              + " max "
              + (maxSize)
              + " Weight: avg "
              + (totWeight / sz)
              + " max "
              + (maxWeight));
    }
  }