| Class | Description |
|---|---|
| GDL |
This class is the main class that contains the algorithm of the GDL.
|
| GraphManipulation |
This class contain all the methods that are necessary for the trees/graphs creation :
- Creation of the local domain graph
- Transformation of the local domain graph into a maximal weight spanning tree
- Creation of the moral graph
- transformation of the maximal weight spanning tree into a junction tree
when the condition are met.
|
| MessagePassing |
This class is the main class that contains the methods in relation with the message passing algorithm.
|