Conversation
mschauer
commented
Aug 6, 2023
Collaborator
|
Nice implementation! Going through vertices from low to high degree in line CausalInference.jl/src/pdag.jl Line 160 in e9bae30 |
Collaborator
|
I started the following WIP PR #113 which is somewhat related as it is about counting and listing the consistent extensions of a PDAG/CPDAG (in contrast to finding an arbitrary one). |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
See https://ftp.cs.ucla.edu/pub/stat_ser/r185-dor-tarsi.pdf. The implementation marks the sinks which were already oriented in a bit vector and does not make a copy of the graph.