{"action":"opened","issue":{"url":"https://api.github.com/repos/julesjulian/secret-santa/issues/3","repository_url":"https://api.github.com/repos/julesjulian/secret-santa","labels_url":"https://api.github.com/repos/julesjulian/secret-santa/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/julesjulian/secret-santa/issues/3/comments","events_url":"https://api.github.com/repos/julesjulian/secret-santa/issues/3/events","html_url":"https://github.com/julesjulian/secret-santa/issues/3","id":276259017,"number":3,"title":"If there is a possible solution, it should be found","user":{"login":"julesjulian","id":4257177,"avatar_url":"https://avatars2.githubusercontent.com/u/4257177?v=4","gravatar_id":"","url":"https://api.github.com/users/julesjulian","html_url":"https://github.com/julesjulian","followers_url":"https://api.github.com/users/julesjulian/followers","following_url":"https://api.github.com/users/julesjulian/following{/other_user}","gists_url":"https://api.github.com/users/julesjulian/gists{/gist_id}","starred_url":"https://api.github.com/users/julesjulian/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/julesjulian/subscriptions","organizations_url":"https://api.github.com/users/julesjulian/orgs","repos_url":"https://api.github.com/users/julesjulian/repos","events_url":"https://api.github.com/users/julesjulian/events{/privacy}","received_events_url":"https://api.github.com/users/julesjulian/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2017-11-23T03:37:40Z","updated_at":"2017-11-23T03:37:40Z","closed_at":null,"author_association":"OWNER","body":"The current algorithm can result in dead-ends. This occurs when all of th remaining santees are blocked for a santa who has yet to find a santee. In this case, an error is thrown and the program has to be run again.\r\n\r\nA solution would be to enumerate all cycles of length N in a directed, cyclic graph describing the scenario and then picking one of the identified cycles at random."}}
{"actor":{"display_login":"julesjulian"}}