Structural statistics of a compiled d-DNNF. More...

#include "dDNNF.h"

Public Attributes
std::size_t	nodes = 0
	Total reachable gates.
std::size_t	edges = 0
	Total wires among reachable gates.
std::size_t	and_gates = 0
	AND (decomposition) gates.
std::size_t	or_gates = 0
	OR (decision) gates.
std::size_t	not_gates = 0
	NOT gates.
std::size_t	inputs = 0
	IN (variable) leaves.
bool	smooth = true
	Every OR gate's children share their variable set.
int	depth = 0
	Longest path (in gates) from the root.

Detailed Description

Structural statistics of a compiled d-DNNF.

Counts are over the gates reachable from root. depth is the longest path (in gates) from the root; smooth is true iff every OR gate's children mention the same set of variables (the property makeSmooth() establishes, required by probabilityEvaluation).

Definition at line 227 of file dDNNF.h.

Member Data Documentation

◆ and_gates

std::size_t dDNNF::Stats::and_gates = 0

AND (decomposition) gates.

Definition at line 230 of file dDNNF.h.

◆ depth

int dDNNF::Stats::depth = 0

Longest path (in gates) from the root.

Definition at line 235 of file dDNNF.h.

◆ edges

std::size_t dDNNF::Stats::edges = 0

Total wires among reachable gates.

Definition at line 229 of file dDNNF.h.

◆ inputs

std::size_t dDNNF::Stats::inputs = 0

IN (variable) leaves.

Definition at line 233 of file dDNNF.h.

◆ nodes

std::size_t dDNNF::Stats::nodes = 0

Total reachable gates.

Definition at line 228 of file dDNNF.h.

◆ not_gates

std::size_t dDNNF::Stats::not_gates = 0

NOT gates.

Definition at line 232 of file dDNNF.h.

◆ or_gates

std::size_t dDNNF::Stats::or_gates = 0

OR (decision) gates.

Definition at line 231 of file dDNNF.h.

◆ smooth

bool dDNNF::Stats::smooth = true

Every OR gate's children share their variable set.

Definition at line 234 of file dDNNF.h.

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

/home/senellar/git/software/provsql/src/dDNNF.h

Public Attributes