Skip to content
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

Jump to bottom

How to construct bipartite graph? #13

Open
wlynn00 opened this issue Jun 25, 2023 · 0 comments
Open

How to construct bipartite graph? #13

wlynn00 opened this issue Jun 25, 2023 · 0 comments

Comments

@wlynn00
Copy link

wlynn00 commented Jun 25, 2023

hi, I think inter2id.txt is obtained from the bipartite graph, but the part of building a bipartite interaction graph is not included in the open source code. And I read the description of building a bipartite interaction graph in the paper, but there are two questions. One is how to determine the starting node of DFS (that is, the root data object)?, and the other is how to divide the subgraph, and how to define the size and scope of the subgraph?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@wlynn00