| Package | Description |
|---|---|
| Environment | |
| GDL | |
| Util_Graph |
| Modifier and Type | Method and Description |
|---|---|
static void |
DISPLAY.MORAL_GRAPH(java.lang.String title,
java.util.List<MoralGraphCell> moralGraph)
This method displays moral graphs
|
| Modifier and Type | Method and Description |
|---|---|
static java.util.List<MoralGraphCell> |
GraphManipulation.createMoralGraph()
This method create the moral graph please see the Chapter III of the
"The Generalized Distributive Law" of Aji & McEliece.
|
static java.util.List<java.util.List<MoralGraphCell>> |
GraphManipulation.triangulateMoralGraph(java.util.List<MoralGraphCell> moralgraph)
In order to transform the moral graph into a junction tree the first step
is to convert the undirected moral graph into a triangulated moral graph.
|
| Modifier and Type | Method and Description |
|---|---|
static Graph |
GraphManipulation.createGraphAfterTriangulate(java.util.List<java.util.List<MoralGraphCell>> listClique)
This method is here to create a graph after the triangulation of the moral graph.
|
static java.util.List<java.util.List<MoralGraphCell>> |
GraphManipulation.triangulateMoralGraph(java.util.List<MoralGraphCell> moralgraph)
In order to transform the moral graph into a junction tree the first step
is to convert the undirected moral graph into a triangulated moral graph.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.ArrayList<MoralGraphCell> |
MoralGraphCell.getListNeighbors() |
| Modifier and Type | Method and Description |
|---|---|
void |
MoralGraphCell.addNeighbor(MoralGraphCell newNeighbor)
This method allow to add a neighbor to the cell.
|
| Modifier and Type | Method and Description |
|---|---|
void |
MoralGraphCell.setListNeighbors(java.util.ArrayList<MoralGraphCell> listNeighbors) |