{"action":"created","issue":{"url":"https://api.github.com/repos/twitter/cassovary/issues/110","labels_url":"https://api.github.com/repos/twitter/cassovary/issues/110/labels{/name}","comments_url":"https://api.github.com/repos/twitter/cassovary/issues/110/comments","events_url":"https://api.github.com/repos/twitter/cassovary/issues/110/events","html_url":"https://github.com/twitter/cassovary/issues/110","id":54398329,"number":110,"title":"Create a graph which keeps neighboring nodes sorted by id","user":{"login":"pankajgupta","id":71128,"avatar_url":"https://avatars.githubusercontent.com/u/71128?v=3","gravatar_id":"","url":"https://api.github.com/users/pankajgupta","html_url":"https://github.com/pankajgupta","followers_url":"https://api.github.com/users/pankajgupta/followers","following_url":"https://api.github.com/users/pankajgupta/following{/other_user}","gists_url":"https://api.github.com/users/pankajgupta/gists{/gist_id}","starred_url":"https://api.github.com/users/pankajgupta/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/pankajgupta/subscriptions","organizations_url":"https://api.github.com/users/pankajgupta/orgs","repos_url":"https://api.github.com/users/pankajgupta/repos","events_url":"https://api.github.com/users/pankajgupta/events{/privacy}","received_events_url":"https://api.github.com/users/pankajgupta/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/twitter/cassovary/labels/enhancement","name":"enhancement","color":"207de5"},{"url":"https://api.github.com/repos/twitter/cassovary/labels/feature+request","name":"feature request","color":"fbca04"}],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":1,"created_at":"2015-01-15T00:43:41Z","updated_at":"2015-01-16T22:43:54Z","closed_at":null,"body":"In some applications one needs fast intersections of adjacency lists and fast search of whether a node v is a neighbor of a node u. In such cases, a graph that keeps the adjacency list in sorted order would be great.\r\n\r\nThis should work for both in and out directions in both ArrayBasedDirectedGraph and SharedArrayBasedDirectedGraph.\r\n"},"comment":{"url":"https://api.github.com/repos/twitter/cassovary/issues/comments/70334859","html_url":"https://github.com/twitter/cassovary/issues/110#issuecomment-70334859","issue_url":"https://api.github.com/repos/twitter/cassovary/issues/110","id":70334859,"user":{"login":"szymonm","id":5087912,"avatar_url":"https://avatars.githubusercontent.com/u/5087912?v=3","gravatar_id":"","url":"https://api.github.com/users/szymonm","html_url":"https://github.com/szymonm","followers_url":"https://api.github.com/users/szymonm/followers","following_url":"https://api.github.com/users/szymonm/following{/other_user}","gists_url":"https://api.github.com/users/szymonm/gists{/gist_id}","starred_url":"https://api.github.com/users/szymonm/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/szymonm/subscriptions","organizations_url":"https://api.github.com/users/szymonm/orgs","repos_url":"https://api.github.com/users/szymonm/repos","events_url":"https://api.github.com/users/szymonm/events{/privacy}","received_events_url":"https://api.github.com/users/szymonm/received_events","type":"User","site_admin":false},"created_at":"2015-01-16T22:43:54Z","updated_at":"2015-01-16T22:43:54Z","body":"What you want is:\r\nFor ArrayBasedDirectedGraph: \r\nTo keep in every node an Array of neighbors (only those existing). Use Binary Search for lookup, linear intersection. Right?"}}