{"action":"opened","issue":{"url":"https://api.github.com/repos/pub-t/pathFind/issues/3","repository_url":"https://api.github.com/repos/pub-t/pathFind","labels_url":"https://api.github.com/repos/pub-t/pathFind/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/pub-t/pathFind/issues/3/comments","events_url":"https://api.github.com/repos/pub-t/pathFind/issues/3/events","html_url":"https://github.com/pub-t/pathFind/issues/3","id":159582177,"number":3,"title":"Поиск маршрута(общий)","user":{"login":"DimaProkop","id":11046461,"avatar_url":"https://avatars.githubusercontent.com/u/11046461?v=3","gravatar_id":"","url":"https://api.github.com/users/DimaProkop","html_url":"https://github.com/DimaProkop","followers_url":"https://api.github.com/users/DimaProkop/followers","following_url":"https://api.github.com/users/DimaProkop/following{/other_user}","gists_url":"https://api.github.com/users/DimaProkop/gists{/gist_id}","starred_url":"https://api.github.com/users/DimaProkop/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/DimaProkop/subscriptions","organizations_url":"https://api.github.com/users/DimaProkop/orgs","repos_url":"https://api.github.com/users/DimaProkop/repos","events_url":"https://api.github.com/users/DimaProkop/events{/privacy}","received_events_url":"https://api.github.com/users/DimaProkop/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2016-06-10T08:15:10Z","updated_at":"2016-06-10T08:15:10Z","closed_at":null,"body":"Найти _кратчайший_ путь уже зная: весь граф, и вес его ребер.\r\nВариант использования алгоритма - [Алгоритм А*](https://ru.wikipedia.org/wiki/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC_%D0%BF%D0%BE%D0%B8%D1%81%D0%BA%D0%B0_A*#.D0.9F.D0.BE.D1.87.D0.B5.D0.BC.D1.83_A.2A_.D0.B4.D0.BE.D0.BF.D1.83.D1.81.D1.82.D0.B8.D0.BC_.D0.B8_.D0.BE.D0.BF.D1.82.D0.B8.D0.BC.D0.B0.D0.BB.D0.B5.D0.BD)"}}
{"actor":{"display_login":"DimaProkop"}}