cc.kave.repackaged.jayes.util.triangulation

Class GraphElimination

java.lang.Object

cc.kave.repackaged.jayes.util.triangulation.GraphElimination

All Implemented Interfaces:

Iterable<List<Integer>>

public class GraphElimination
extends Object
implements Iterable<List<Integer>>

Graph elimination based on greedy minimum fill-in heuristic. Tie-breaking is done by using weights on the nodes. On tie, the node is chosen that will result in the cluster with a minimal sum of node weights

Constructor Summary

Constructors

Constructor and Description
GraphElimination(Graph graph, double[] nodeWeights, IEliminationHeuristic heuristic)

Method Summary

Modifier and Type	Method and Description
Iterator<List<Integer>>	iterator()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

GraphElimination

public GraphElimination(Graph graph,
                        double[] nodeWeights,
                        IEliminationHeuristic heuristic)

Method Detail

iterator

public Iterator<List<Integer>> iterator()

Specified by:

iterator in interface Iterable<List<Integer>>