Potential additions

[mwien]

CPDAGs:

• CPDAG to DAG (deterministic, no sampling)
• DAG to CPDAG
• CPDAG check (is a graph a CPDAG?)
• Listing DAGs -> implement iterator

MPDAGs:

• MPDAG to DAG
• MPDAG check
• Count DAGs represented by MPDAG (?)
• Sample DAG represented by MPDAG (?)
• Listing DAGs -> implement iterator

"Interventional" CPDAGs:

• use CPDAG algorithms under the hood (to DAG, counting, sampling, listing etc) -> still distinguish in wrapper
• maybe add check for this graph class as well
• algorithm for finding new "interventional" CPDAG after single-target intervention results in linear-time (?)

PDAGs:

• Acyclicity check
• PDAG to MPDAG
• PDAG to DAG