Skip to content

Update FCI.py for fixing isNoncollider #179

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Apr 16, 2024
Merged

Update FCI.py for fixing isNoncollider #179

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
c29d0ff
Update FCI.py for fixing isNoncollider
svenpieper Apr 8, 2024
6040276
Update FCI.py - using node_map to only get node_map func once
svenpieper Apr 8, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 3 additions & 2 deletions causallearn/search/ConstraintBased/FCI.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -320,8 +320,9 @@ def rulesR1R2cycle(graph: Graph, bk: BackgroundKnowledge | None, changeFlag: boo

def isNoncollider(graph: Graph, sep_sets: Dict[Tuple[int, int], Set[int]], node_i: Node, node_j: Node,
node_k: Node) -> bool:
sep_set = sep_sets[(graph.get_node_map()[node_i], graph.get_node_map()[node_k])]
return sep_set is not None and sep_set.__contains__(graph.get_node_map()[node_j])
node_map = graph.get_node_map()
sep_set = sep_sets.get((node_map[node_i], node_map[node_k]))
return sep_set is not None and sep_set.__contains__(node_map[node_j])


def ruleR3(graph: Graph, sep_sets: Dict[Tuple[int, int], Set[int]], bk: BackgroundKnowledge | None, changeFlag: bool,
Expand Down