cc.kave.repackaged.jayes.util.triangulation

Class QuotientGraph

java.lang.Object

cc.kave.repackaged.jayes.util.triangulation.QuotientGraph

public class QuotientGraph
extends Object

Quotient graphs are special data structures for the perfect elimination order problem. Their size stays in O(|E|) where E is the set of edges. Using plain graphs would result in a storage complexity of O(|E*|), where E* is the set of Edges united with the set of "fill-in" edges generated during elimination. See "An Approximate Minimum Degree Ordering Algorithm" (Amestoy et al. 1996)

Constructor Summary

Constructors

Constructor and Description
QuotientGraph(Graph graph)

Method Summary

Modifier and Type	Method and Description
void	eliminate(int variable)
Set<Integer>	getNeighbors(int variable)
void	merge(Graph graph, int v1, int v2)

Methods inherited from class java.lang.Object

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

Constructor Detail

QuotientGraph

public QuotientGraph(Graph graph)

Method Detail

getNeighbors

public Set<Integer> getNeighbors(int variable)

eliminate

public void eliminate(int variable)

merge

public void merge(Graph graph,
                  int v1,
                  int v2)