the direct of two nodes in adjacency matrix which is result of ICALiNGAM
Open
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 1.7k
- Forks
- 274
- PR merge metrics
- No merged PRs in 30d
Description
how to get the right graph direction between tow nodes? for example:
causal_order_ = [3,0,2,1,4,5]
adjacency_matrix =
[[0, 0, 0, 3, 0, 0]
[3, 0, 2, 0, 0, 0]
[0, 0, 0, 6, 0, 0]
[0, 0, 0, 0, 0, 0]
[8, 0, -1, 0, 0, 0]
[4, 0, 0, 0, 0, 0]]
how can I get the right directed graph?
thank you
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 reading the ICALiNGAM documentation and the API description for causal_order_ and adjacency_matrix, then reproduce the example matrix to determine how edge direction is represented. Done means the repository documents how to interpret direction between two nodes, including the shown output.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- machine-learning
- Issue type
- Documentation
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100