Marcel Wienöbst

WIP: Algorithm for counting the number of consistent extensions (size of an MEC given a CPDAG)

8

Next step I think is adding the following methods, most of which are already implemented, but I'm still thinking about the proper way to integrate them (and need some time...

Give the option to use the stable version of the PC

5

In the README.md and Docs it says that pcalg implements the *stable* PC algorithm. I might be missing something but to me the implementation looks like the standard PC. The...

SHD is easily added. I think SID (at leasts for DAGs) should also be possible using the methods for adjustment sets we already have. SID for CPDAGs is trickier, but...

Some fairly free optimizations. I benchmarked briefly for graphs with 16 vertices. - avoiding the unnecessary memoizations by calling ```local_score_``` directly: reduces execution time from ~2.5s to ~1.2s (so roughly...

Potentially biased results in hepar2 example

1

In the hepar2 example GRaSP clearly outperforms all other methods (Fig. 8 (c) and (d) in the paper) . After some inspection, it might be because in the instance the...