{"action":"created","issue":{"url":"https://api.github.com/repos/JuliaGraphs/LightGraphs.jl/issues/231","labels_url":"https://api.github.com/repos/JuliaGraphs/LightGraphs.jl/issues/231/labels{/name}","comments_url":"https://api.github.com/repos/JuliaGraphs/LightGraphs.jl/issues/231/comments","events_url":"https://api.github.com/repos/JuliaGraphs/LightGraphs.jl/issues/231/events","html_url":"https://github.com/JuliaGraphs/LightGraphs.jl/issues/231","id":116697185,"number":231,"title":"WIP: multiple changes to backend structure","user":{"login":"sbromberger","id":941359,"avatar_url":"https://avatars.githubusercontent.com/u/941359?v=3","gravatar_id":"","url":"https://api.github.com/users/sbromberger","html_url":"https://github.com/sbromberger","followers_url":"https://api.github.com/users/sbromberger/followers","following_url":"https://api.github.com/users/sbromberger/following{/other_user}","gists_url":"https://api.github.com/users/sbromberger/gists{/gist_id}","starred_url":"https://api.github.com/users/sbromberger/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/sbromberger/subscriptions","organizations_url":"https://api.github.com/users/sbromberger/orgs","repos_url":"https://api.github.com/users/sbromberger/repos","events_url":"https://api.github.com/users/sbromberger/events{/privacy}","received_events_url":"https://api.github.com/users/sbromberger/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/JuliaGraphs/LightGraphs.jl/labels/enhancement","name":"enhancement","color":"84b6eb"}],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":3,"created_at":"2015-11-13T04:16:30Z","updated_at":"2015-11-13T14:22:01Z","closed_at":null,"body":"- [ ] get rid of edge sets in favor of efficient edge iterators (#221, #230)\r\n- [ ] implement sorted adjacency lists (#232, see below)\r\n- [ ] remove `unsafe_add_edge!()` and modify `add_edge!()` to silently accept (and discard) duplicates (#232)\r\n- [ ] create edge indices and get rid of Dict mappings for edges."},"comment":{"url":"https://api.github.com/repos/JuliaGraphs/LightGraphs.jl/issues/comments/156445210","html_url":"https://github.com/JuliaGraphs/LightGraphs.jl/issues/231#issuecomment-156445210","issue_url":"https://api.github.com/repos/JuliaGraphs/LightGraphs.jl/issues/231","id":156445210,"user":{"login":"jpfairbanks","id":2753998,"avatar_url":"https://avatars.githubusercontent.com/u/2753998?v=3","gravatar_id":"","url":"https://api.github.com/users/jpfairbanks","html_url":"https://github.com/jpfairbanks","followers_url":"https://api.github.com/users/jpfairbanks/followers","following_url":"https://api.github.com/users/jpfairbanks/following{/other_user}","gists_url":"https://api.github.com/users/jpfairbanks/gists{/gist_id}","starred_url":"https://api.github.com/users/jpfairbanks/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jpfairbanks/subscriptions","organizations_url":"https://api.github.com/users/jpfairbanks/orgs","repos_url":"https://api.github.com/users/jpfairbanks/repos","events_url":"https://api.github.com/users/jpfairbanks/events{/privacy}","received_events_url":"https://api.github.com/users/jpfairbanks/received_events","type":"User","site_admin":false},"created_at":"2015-11-13T14:22:01Z","updated_at":"2015-11-13T14:22:01Z","body":"the first step is to benchmark sorted insertion from stefan's function.\r\n\r\nThen maybe we have to go to a blocked adjacency list for this.\r\n```\r\n[1|2|3|ptr]->[4|5|6|ptr]->...->[n-1|n|end]\r\n```\r\n\r\nWe should probably replace edge sets with edge iterators, we could also provide a function to sort the input edges so that when you insert them, the graph will be constructed in sorted order."}}