Questions about is_dseparated_from
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 1.7k
- Forks
- 274
- PR merge metrics
- No merged PRs in 30d
Description
I have the following GeneralGraph() object named D with the following adjacency matrix (from D.graph) and I use is_dseparated_from to check whether nodes 0 and 2 are d-separated given an empty set. The function is_dseparated_from seems to get stuck somewhere and it never returns. Is this expected?
[[ 0 0 0 0 0 1 0 1 1 0]
[ 0 0 0 0 0 0 0 0 0 0]
[ 0 0 0 0 0 0 1 0 0 0]
[ 0 0 0 0 0 0 1 0 1 0]
[ 0 0 0 0 0 -1 0 -1 0 0]
[ 1 0 0 0 1 0 0 2 0 1]
[ 0 0 1 1 0 0 0 0 0 1]
[ 1 0 0 0 1 2 0 0 0 1]
[ 1 0 0 1 0 0 0 0 0 0]
[ 0 0 0 0 0 1 1 1 0 0]]
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reproducing the hang with the provided adjacency matrix and the GeneralGraph() object, then inspect the implementation of is_dseparated_from. Determine where execution fails to terminate and verify the function's behavior for nodes 0 and 2 given an empty conditioning set.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- machine-learning
- Issue type
- Bug
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100