{"action":"opened","issue":{"url":"https://api.github.com/repos/jakobbossek/mcCPPGraph/issues/16","repository_url":"https://api.github.com/repos/jakobbossek/mcCPPGraph","labels_url":"https://api.github.com/repos/jakobbossek/mcCPPGraph/issues/16/labels{/name}","comments_url":"https://api.github.com/repos/jakobbossek/mcCPPGraph/issues/16/comments","events_url":"https://api.github.com/repos/jakobbossek/mcCPPGraph/issues/16/events","html_url":"https://github.com/jakobbossek/mcCPPGraph/issues/16","id":294597061,"number":16,"title":"overload getMSTKruskal","user":{"login":"jakobbossek","id":4079979,"avatar_url":"https://avatars1.githubusercontent.com/u/4079979?v=4","gravatar_id":"","url":"https://api.github.com/users/jakobbossek","html_url":"https://github.com/jakobbossek","followers_url":"https://api.github.com/users/jakobbossek/followers","following_url":"https://api.github.com/users/jakobbossek/following{/other_user}","gists_url":"https://api.github.com/users/jakobbossek/gists{/gist_id}","starred_url":"https://api.github.com/users/jakobbossek/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jakobbossek/subscriptions","organizations_url":"https://api.github.com/users/jakobbossek/orgs","repos_url":"https://api.github.com/users/jakobbossek/repos","events_url":"https://api.github.com/users/jakobbossek/events{/privacy}","received_events_url":"https://api.github.com/users/jakobbossek/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-02-06T01:04:23Z","updated_at":"2018-02-06T01:04:23Z","closed_at":null,"author_association":"OWNER","body":"Allow to pass a forest as starting point! Basically this functionality allows for subforest mutation. However, this is for sure not the best solutions since in the worst-case we need to go through all |E| edges.\r\n\r\n- [ ] Graph / forest should be passed\r\n- [ ] We need to apply some UnionFind::unite operations before the loop starts. Or even better, extend UnionFind constructor to init the set with the connected components already!"}}
{"actor":{"display_login":"jakobbossek"}}