A bounded-hop all-targets compilation. More...

#include "ReachabilityCompiler.h"

Collaboration diagram for ReachabilityCompiler::AllHopsResult:

[legend]

Public Attributes
dDNNF	dd
	Shared circuit.
std::vector< VertexHopRoot >	roots
	Per (vertex, exact length) roots.
std::vector< VertexRoot >	within_roots
	Per-vertex "within the bound" roots.
Stats	stats
	Compilation statistics.

Detailed Description

A bounded-hop all-targets compilation.

One root per (vertex, walk length) pair achievable in the all-edges-present world – matching the rows the generic recursive fixpoint derives for a hop-counting CTE, whose row (v,h) provenance is "some *walk* of exactly @c h edges" (walks, not paths: a cycle on the way pumps achievable lengths) – plus, per vertex, the root of "some walk of at most the bound", which a hop-counting query deduplicating away the hop column computes as the OR of the per-length roots.

Definition at line 140 of file ReachabilityCompiler.h.

Member Data Documentation

◆ dd

dDNNF ReachabilityCompiler::AllHopsResult::dd

Shared circuit.

Definition at line 141 of file ReachabilityCompiler.h.

◆ roots

std::vector<VertexHopRoot> ReachabilityCompiler::AllHopsResult::roots

Per (vertex, exact length) roots.

Definition at line 142 of file ReachabilityCompiler.h.

◆ stats

Stats ReachabilityCompiler::AllHopsResult::stats

Compilation statistics.

Definition at line 144 of file ReachabilityCompiler.h.

◆ within_roots

std::vector<VertexRoot> ReachabilityCompiler::AllHopsResult::within_roots

Per-vertex "within the bound" roots.

Definition at line 143 of file ReachabilityCompiler.h.

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

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