The graph for conditional dependence between different nodes must be a directed acyclic graph. Checking the DAG-ness would be a useful addition in the data block of a Stan program to avoid unexpected behavior. Tarjan's algorithm is a possible implementation.
The graph for conditional dependence between different nodes must be a directed acyclic graph. Checking the DAG-ness would be a useful addition in the
datablock of a Stan program to avoid unexpected behavior. Tarjan's algorithm is a possible implementation.