faster separator finding and MAGs

jtextor / dagitty

Graphical analysis of structural causal models / graphical causal models.

GNU General Public License v2.0

282 stars 46 forks source link

faster separator finding and MAGs #19

Closed benibela closed 6 years ago

benibela commented 6 years ago

speed up functions to find separators without moral graph:

closeSeparator: nearest separator that is not minimal anymore
findMinimalSeparator: minimal nearest separator
and new: dagToMag conversion

benibela commented 6 years ago

e89c2bf fixes a case like V -> X1 -> X2 -> Y. If it checks visibility in the backdoor graph, it deletes X1 -> X2 first, and then X2 -> Y is no longer visible, and no adjustment exists. Not sure, if there are other cases that need fixing