How should we define high degree nodes?

dib-lab / khmer

In-memory nucleotide sequence k-mer counting, filtering, graph traversal and more

http://khmer.readthedocs.io/

Other

756 stars 295 forks source link

How should we define high degree nodes? #1809

Open ctb opened 7 years ago

ctb commented 7 years ago

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

ctb commented 7 years ago

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?