search

waynebhayes / SANA

Simulating Annealing Network Aligner
25 stars 39 forks source link

SANA2.0: Have option of not storing adjacency matrix #6

Open khosravipasha opened 6 years ago

khosravipasha commented 6 years ago

Some graphs are much bigger, and storing a O(n^2) adjacency matrix is not doable. On bigger graphs we should only have adjancey list (maybe list of hashsets)

red4711 commented 6 years ago

Is this issue closed?

waynebhayes commented 6 years ago

I don't know; how much slower will it make SANA 2.0 if we remove the adjacency matrix?

-- Wayne Hayes, Ph.D. Associate Professor, Computer Science, University of California, Irvine President Trump is a self-absorbed, self-serving, habitual liar. The former two are opinion; the latter is fact. Examples (1) http://foreignpolicy.com/2017/08/18/trumps-lies-about-james-comey-keep-unraveling . (2) https://www.theguardian.com/us-news/trump-administration

On Thu, Feb 15, 2018 at 4:40 PM, Linh Tam Chu notifications@github.com wrote:

Is this issue closed?

— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/waynebhayes/SANA/issues/6#issuecomment-366110636, or mute the thread https://github.com/notifications/unsubscribe-auth/ATUkjKMoJP-oU-iFvqJo98dED_-WOC-kks5tVM6UgaJpZM4Rtv2U .