How should we define high degree nodes?

Open ctb opened this issue 8 years ago • 1 comments

via @camillescott comment https://github.com/dib-lab/khmer/pull/1808#discussion_r146736230:

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).

Oct 25 '17 13:10 ctb

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?

Oct 25 '17 13:10 ctb