Uses the an identification criterion of Drton and Weihs (2015); this version
of the algorithm is somewhat different from Drton and Weihs (2015) in that it
also works on cyclic graphs. The original version of the algorithm can be
found in the function
TRUE or FALSE determining whether or not the Tian decomposition should be used before running the current generic identification algorithm. In general letting this be TRUE will make the algorithm faster and more powerful.
see the return of
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.