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 should we define high degree nodes? #1809

Open
ctb opened this issue Oct 25, 2017 · 1 comment
Open

How should we define high degree nodes? #1809

ctb opened this issue Oct 25, 2017 · 1 comment

Comments

@ctb
Copy link
Member

ctb commented Oct 25, 2017

via @camillescott comment #1808 (comment):

Camille says:

Consider:

(HDN)--->(neighbor_A)---...
     \-->(neighbor_C)---...

This is a degree 2 node, but it should probably be counted as a HDN in the context of a cDBG (in the context of my streaming compactor, I'm counting it as one).
@ctb
Copy link
Member Author

ctb commented Oct 25, 2017

For undirected graphs, I think the current definition works, no? And in khmer all of the implementations are (currently) undirected, although that may change in the future with lDBG/boinc, right?

@ctb ctb mentioned this issue Oct 25, 2017
Merged
8 tasks
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
@ctb