| Class | Description |
|---|---|
| Edge |
In the "The Generalized Distributive Law" of Aji & McEliece the
construction of tree is the center of the algorithm for solving the MPF
problem. [ See the "The Generalized Distributive Law" of Aji & McEliece,
Chapter III ( ie : p330 second column) ].
|
| Graph |
When the graph is represented with a list of vertices and a list of edges this class is used to put them all together instead of having
in one hand all the vertices and in an other one all the edges
|
| InformationsOnCell |
The GDL can be scheduled fully serially, in which case each message is sent
only once, and each state is computed only once.
|
| JunctionTreeCell |
In the "The Generalized Distributive Law" of Aji & McEliece the
construction of tree is the center of the algorithm for solving the MPF
problem. [ See the "The Generalized Distributive Law" of Aji & McEliece,
Chapter III ( ie : p330 second column) ].
|
| MoralGraphCell |
In the "The Generalized Distributive Law" of Aji & McEliece the
construction of tree is the center of the algorithm for solving the MPF
problem. [ See the "The Generalized Distributive Law" of Aji & McEliece,
Chapter III ( ie : p330 second column) ].
|
| Vertex |
In the "The Generalized Distributive Law" of Aji & McEliece the
construction of tree is the center of the algorithm for solving the MPF
problem. [ See the "The Generalized Distributive Law" of Aji & McEliece,
Chapter III ( ie : p330 second column) ].
|
| VertexToLocalDomain |