checks whether a graph is recursively identifiable by only using the local BB-criterion
checkLocalBBCriterion(adjMatrix, latentNodes, observedNodes)a list consisting of a Boolean, whether the graph is sign-identifiable and if yes, a list consisting of the sets
of the graph
set of latent nodes
set of observed nodes
Sturma, N., Kranzlmüller, M., Portakal, I., and Drton, M. (2025) Matching Criterion for Identifiability in Sparse Factor Analysis. arXiv:2502.02986