aGrUM  0.13.2
gum::CliqueGraph::__RunningIntersect Struct Reference

structure used for the computation of the running intersection property More...

Collaboration diagram for gum::CliqueGraph::__RunningIntersect:

## Public Attributes

NodeSet visited_cliques
structure indicating for each clique whether it has been examined by a DFS (Depth First Search) More...

NodeSet nodes_other_components
structure indicating the nodes that belong to other connected components More...

NodeSet nodes_DFS_forbidden
the nodes that are currently forbidden by separators in the DFS More...

NodeSet nodes_DFS_seen
set of the nodes examined during the current DFS More...

NodeProperty< NodeSetcliques_DFS_chain
for each clique, the list of its nodes that require accessing the clique through a chain More...

## Detailed Description

structure used for the computation of the running intersection property

Definition at line 250 of file cliqueGraph.h.

## Member Data Documentation

 NodeProperty< NodeSet > gum::CliqueGraph::__RunningIntersect::cliques_DFS_chain

for each clique, the list of its nodes that require accessing the clique through a chain

At the beginning, all nodes in a clique require a chain to be accessed. In a DFS, when a chain reaches a clique, we remove from cliques_DFS_chain the nodes that are not forbidden by the DFS, i.e., the nodes that are reachable by the chain starting from the root of the DFS. These are the nodes that belong to the separators. Hence, after completing all the DFS, there remain in cliques_DFS_chain only the nodes that are accessible by no chain but that are found in several parts of the clique graph. In such a case, this is a violation of the running intersection property. Hence, for the latter to hold, after completion of all the DFS, cliques_DFS_chain must contain only empty sets.

Definition at line 286 of file cliqueGraph.h.

 NodeSet gum::CliqueGraph::__RunningIntersect::nodes_DFS_forbidden

the nodes that are currently forbidden by separators in the DFS

Definition at line 263 of file cliqueGraph.h.

 NodeSet gum::CliqueGraph::__RunningIntersect::nodes_DFS_seen

set of the nodes examined during the current DFS

Definition at line 266 of file cliqueGraph.h.

 NodeSet gum::CliqueGraph::__RunningIntersect::nodes_other_components

structure indicating the nodes that belong to other connected components

These nodes must not be found in the current connected component if the running intersection holds

Definition at line 260 of file cliqueGraph.h.

 NodeSet gum::CliqueGraph::__RunningIntersect::visited_cliques

structure indicating for each clique whether it has been examined by a DFS (Depth First Search)

Definition at line 253 of file cliqueGraph.h.

The documentation for this struct was generated from the following file: