Port of solver_ssa_reachability.m's return: [SSq, SSh, sn.space]. More...

#include <line/solvers/ssa/solver_ssa_serial.h>

Collaboration diagram for line::ssa::SsaReachability< T >:

Public Attributes
std::vector< qn::NetState< T > >	space
	the reachable states
std::vector< std::vector< std::vector< T > > >	node_space
	sn.space, per stateful node
std::vector< std::vector< std::size_t > >	hash
	SSh, 1-based per node
Matrix< T >	ssq
	SSq, states x concatenated width

Detailed Description

template<class T>
struct line::ssa::SsaReachability< T >

Port of solver_ssa_reachability.m's return: [SSq, SSh, sn.space].

node_space[i] is the reference's space{i}, the distinct local rows node i was seen in; hash is SSh, one 1-BASED index into node_space[i] per stateful node per state; ssq is SSq, the same states with their local rows concatenated. The three are redundant by construction and the reference returns all three because its callers index states by node (SSh) and read them flat (SSq).

THE ORDER IS THE WALK'S, NOT THE REFERENCE'S. The reference pushes and pops a stack of its own; this reuses reachable_space_generator, whose stack order differs. The SET is the same and nothing downstream indexes it positionally across codebases, so the difference is not observable in a metric.

Definition at line 124 of file solver_ssa_serial.h.