| Package | Description |
|---|---|
| Environment | |
| GDL |
| Modifier and Type | Method and Description |
|---|---|
static void |
DISPLAY.GRAPH(java.lang.String title,
Graph graph)
This method is used to display graphs
|
| Modifier and Type | Method and Description |
|---|---|
static Graph |
GraphManipulation.addLeavesV2(Graph graph)
After that the triangulation of the moral graph have been performed and a tree which have the cliques of the triangulated moral
graph as node have been created, the GDL algorithm state that the old local domain must now been add to the created tree.
|
static Graph |
GraphManipulation.CreateEdgesInLocalDomainGraph(Graph vertexLocalDomainGraph)
In the "The Generalized Distributive Law" of Aji & McEliece the local
domain graph is defined as follow :
The local domain graph is a weighted complete graph with M vertices
V1, ..., Vm, one for each local domain, with the weight of the edge
defined by : Wi,j = |Si Union Sj|
[ See the "The Generalized Distributive Law" of Aji & McEliece,]
This method create this local domain graph, the created graph is
available in two fields :
- 'listVertex' for the list of the vertex
- 'listEdgeDomainGraph' for the edges
|
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 Graph |
GraphManipulation.createMaximalSpanningTree(Graph graph)
The goal of the local domain graph is to create the maximal weight
spanning tree [ See the "The Generalized Distributive Law" of Aji
& McEliece].
|
static Graph |
GraphManipulation.mergeNonAffectedCell(Graph graph)
This method is the instantiation of a solution that I present in my master Report.
|
static Graph |
GraphManipulation.putLocalDomainInGraph()
This method is simply use in order to put all the local domain in vertex.
|
| Modifier and Type | Method and Description |
|---|---|
static Graph |
GraphManipulation.addLeavesV2(Graph graph)
After that the triangulation of the moral graph have been performed and a tree which have the cliques of the triangulated moral
graph as node have been created, the GDL algorithm state that the old local domain must now been add to the created tree.
|
static java.util.List<JunctionTreeCell> |
GraphManipulation.convertSpanningTreeIntoJunctionTree(Graph spanningTree)
If the maximal weight spanning tree is a junction tree this method will convert the data format of it.
|
static Graph |
GraphManipulation.CreateEdgesInLocalDomainGraph(Graph vertexLocalDomainGraph)
In the "The Generalized Distributive Law" of Aji & McEliece the local
domain graph is defined as follow :
The local domain graph is a weighted complete graph with M vertices
V1, ..., Vm, one for each local domain, with the weight of the edge
defined by : Wi,j = |Si Union Sj|
[ See the "The Generalized Distributive Law" of Aji & McEliece,]
This method create this local domain graph, the created graph is
available in two fields :
- 'listVertex' for the list of the vertex
- 'listEdgeDomainGraph' for the edges
|
static Graph |
GraphManipulation.createMaximalSpanningTree(Graph graph)
The goal of the local domain graph is to create the maximal weight
spanning tree [ See the "The Generalized Distributive Law" of Aji
& McEliece].
|
static Graph |
GraphManipulation.mergeNonAffectedCell(Graph graph)
This method is the instantiation of a solution that I present in my master Report.
|
static boolean |
GraphManipulation.spanningTreeIsJunctionTree(Graph spanningTree)
This method calculate if the maximal weight spanning tree in parameter is a junction tree.
|