{"action":"created","issue":{"url":"https://api.github.com/repos/aalhour/C-Sharp-Algorithms/issues/3","labels_url":"https://api.github.com/repos/aalhour/C-Sharp-Algorithms/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/aalhour/C-Sharp-Algorithms/issues/3/comments","events_url":"https://api.github.com/repos/aalhour/C-Sharp-Algorithms/issues/3/events","html_url":"https://github.com/aalhour/C-Sharp-Algorithms/issues/3","id":98519605,"number":3,"title":"Graph by clans","user":{"login":"karv","id":3241083,"avatar_url":"https://avatars.githubusercontent.com/u/3241083?v=3","gravatar_id":"","url":"https://api.github.com/users/karv","html_url":"https://github.com/karv","followers_url":"https://api.github.com/users/karv/followers","following_url":"https://api.github.com/users/karv/following{/other_user}","gists_url":"https://api.github.com/users/karv/gists{/gist_id}","starred_url":"https://api.github.com/users/karv/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/karv/subscriptions","organizations_url":"https://api.github.com/users/karv/orgs","repos_url":"https://api.github.com/users/karv/repos","events_url":"https://api.github.com/users/karv/events{/privacy}","received_events_url":"https://api.github.com/users/karv/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":7,"created_at":"2015-08-01T08:10:05Z","updated_at":"2015-08-06T07:03:35Z","closed_at":"2015-08-06T07:03:35Z","body":"I have implemented an similar `IGraph<T>`, which acts like a undirected unweighted graph. \r\nIt should be fast at finding paths and other connexity algorimths; but slower at direct manipulation like adding or removing edges.\r\n\r\nIt stores in memory the clan: the maximal complete subgraphs in `ISet<T>`'s \r\n\r\nIf you are interesed i could implement it to your `IGraph<T>` interface and merge it."},"comment":{"url":"https://api.github.com/repos/aalhour/C-Sharp-Algorithms/issues/comments/128271956","html_url":"https://github.com/aalhour/C-Sharp-Algorithms/issues/3#issuecomment-128271956","issue_url":"https://api.github.com/repos/aalhour/C-Sharp-Algorithms/issues/3","id":128271956,"user":{"login":"aalhour","id":1282375,"avatar_url":"https://avatars.githubusercontent.com/u/1282375?v=3","gravatar_id":"","url":"https://api.github.com/users/aalhour","html_url":"https://github.com/aalhour","followers_url":"https://api.github.com/users/aalhour/followers","following_url":"https://api.github.com/users/aalhour/following{/other_user}","gists_url":"https://api.github.com/users/aalhour/gists{/gist_id}","starred_url":"https://api.github.com/users/aalhour/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/aalhour/subscriptions","organizations_url":"https://api.github.com/users/aalhour/orgs","repos_url":"https://api.github.com/users/aalhour/repos","events_url":"https://api.github.com/users/aalhour/events{/privacy}","received_events_url":"https://api.github.com/users/aalhour/received_events","type":"User","site_admin":false},"created_at":"2015-08-06T07:03:35Z","updated_at":"2015-08-06T07:03:35Z","body":"The pull request was merged. I had to cleanup the indentation space via Visual Studio. I also added an underscore in front of the private methods. Didn't change anything else. I also added you to the list of contributors. Check the README.md and the source code at my repo. Thanks for your contribution."}}