TriangulationMethod

public enum TriangulationMethod

The TriangulationMethod type represents the triangulation method used for this Domain. Triangulation is the process of transforming the graph of a Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain.

  • Represents the clique-size triangulation heuristic.

    Triangulation is the process of transforming the graph of this Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain.

    As its score function, this heuristic uses the size of N(v), where N(v) is the set of neighbors of the target node v (i.e., the node to be eliminated next in the elimination order used for triangulating the graph).

    Declaration

    Swift

    case cliqueSize

  • Represents the clique-weight triangulation heuristic.

    Triangulation is the process of transforming the graph of this Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain.

    As its score function, this heuristic uses the product of the number of states of the discrete nodes in N(v) multiplied by a

    • bm(m + 3)/2, where m is the number of continuous nodes in N(v), a and b are the size of the types h_number_t and h_double_t, respectively, and N(v) is the set of neighbors of the target node v (i.e., the node to be eliminated next in the elimination order used for triangulating the graph).

    Declaration

    Swift

    case cliqueWeight

  • Represents the fill-in-size triangulation heuristic.

    Triangulation is the process of transforming the graph of this Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain.

    As its score function, this heuristic uses the number of fill-in links required to complete the neighbors of a target node (i.e., the node to be eliminated next in the elimination order used for triangulating the graph).

    Declaration

    Swift

    case fillInSize

  • Represents the fill-in-weight triangulation heuristic.

    Triangulation is the process of transforming the graph of this Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain.

    As its score function, this heuristic uses the sum of the weights of the fill-in links required to complete the neighbors of a target node (i.e., the node to be eliminated next in the elimination order used for triangulating the graph).

    Declaration

    Swift

    case fillInWeight

  • Represents the best-greedy triangulation heuristic.

    Triangulation is the process of transforming the graph of this Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain.

    This heuristic tries all the greedy elimination heuristics and uses the best result.

    Declaration

    Swift

    case bestGreedy

  • Represents the total clique-table size triangulation algorithm.

    Triangulation is the process of transforming the graph of this Domain to a triangulated graph, which forms the basis for constructing the JunctionTree of the Domain.

    This algorithm is also sometimes referred to as the optimal triangulation algorithm.

    See also

    Domain.setInitialTriangulation([Node])

    See also

    Domain.setMaxNumberOfSeparators(Int?)

    See also

    Domain.setMaxSeparatorSize (Int?)

    Declaration

    Swift

    case totalWeight