{"action":"closed","issue":{"url":"https://api.github.com/repos/neurodata/ndmg/issues/18","repository_url":"https://api.github.com/repos/neurodata/ndmg","labels_url":"https://api.github.com/repos/neurodata/ndmg/issues/18/labels{/name}","comments_url":"https://api.github.com/repos/neurodata/ndmg/issues/18/comments","events_url":"https://api.github.com/repos/neurodata/ndmg/issues/18/events","html_url":"https://github.com/neurodata/ndmg/issues/18","id":131089828,"number":18,"title":"build graphs in a memory efficient way","user":{"login":"willgray","id":884780,"avatar_url":"https://avatars.githubusercontent.com/u/884780?v=3","gravatar_id":"","url":"https://api.github.com/users/willgray","html_url":"https://github.com/willgray","followers_url":"https://api.github.com/users/willgray/followers","following_url":"https://api.github.com/users/willgray/following{/other_user}","gists_url":"https://api.github.com/users/willgray/gists{/gist_id}","starred_url":"https://api.github.com/users/willgray/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/willgray/subscriptions","organizations_url":"https://api.github.com/users/willgray/orgs","repos_url":"https://api.github.com/users/willgray/repos","events_url":"https://api.github.com/users/willgray/events{/privacy}","received_events_url":"https://api.github.com/users/willgray/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2016-02-03T17:07:36Z","updated_at":"2016-02-10T00:22:49Z","closed_at":"2016-02-10T00:22:49Z","body":"decoupling from the other task because not strictly required for non-big graphs.\r\n\r\nCurrently we build from adjacency matrices, which is inefficient, but logic is more straightfoward to debug."}}