{"action":"created","issue":{"url":"https://api.github.com/repos/jgrapht/jgrapht/issues/313","repository_url":"https://api.github.com/repos/jgrapht/jgrapht","labels_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/313/labels{/name}","comments_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/313/comments","events_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/313/events","html_url":"https://github.com/jgrapht/jgrapht/issues/313","id":182048519,"number":313,"title":"getEulerianCircuitVertices in EulerianCircuit needs a rework","user":{"login":"jkinable","id":2742474,"avatar_url":"https://avatars.githubusercontent.com/u/2742474?v=3","gravatar_id":"","url":"https://api.github.com/users/jkinable","html_url":"https://github.com/jkinable","followers_url":"https://api.github.com/users/jkinable/followers","following_url":"https://api.github.com/users/jkinable/following{/other_user}","gists_url":"https://api.github.com/users/jkinable/gists{/gist_id}","starred_url":"https://api.github.com/users/jkinable/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jkinable/subscriptions","organizations_url":"https://api.github.com/users/jkinable/orgs","repos_url":"https://api.github.com/users/jkinable/repos","events_url":"https://api.github.com/users/jkinable/events{/privacy}","received_events_url":"https://api.github.com/users/jkinable/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/jgrapht/jgrapht/labels/enhancement","name":"enhancement","color":"84b6eb"}],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":2,"created_at":"2016-10-10T15:45:06Z","updated_at":"2016-10-18T08:24:15Z","closed_at":"2016-10-18T08:24:15Z","body":"Issues with `EulerianCircuit.getEulerianCircuitVertices(...)`:\r\n\r\n1. The function should return a `GraphWalk`, instead of a `List`\r\n2. If possible, the function should operate on a Graph, instead being limited to UndirectedGraphs\r\n3. If possible, the description should mention which the name of the algorithm used to produced the result. There exist multiple algorithms to solve this problem, some of them are inefficient. "},"comment":{"url":"https://api.github.com/repos/jgrapht/jgrapht/issues/comments/254440265","html_url":"https://github.com/jgrapht/jgrapht/issues/313#issuecomment-254440265","issue_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/313","id":254440265,"user":{"login":"d-michail","id":15940875,"avatar_url":"https://avatars.githubusercontent.com/u/15940875?v=3","gravatar_id":"","url":"https://api.github.com/users/d-michail","html_url":"https://github.com/d-michail","followers_url":"https://api.github.com/users/d-michail/followers","following_url":"https://api.github.com/users/d-michail/following{/other_user}","gists_url":"https://api.github.com/users/d-michail/gists{/gist_id}","starred_url":"https://api.github.com/users/d-michail/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/d-michail/subscriptions","organizations_url":"https://api.github.com/users/d-michail/orgs","repos_url":"https://api.github.com/users/d-michail/repos","events_url":"https://api.github.com/users/d-michail/events{/privacy}","received_events_url":"https://api.github.com/users/d-michail/received_events","type":"User","site_admin":false},"created_at":"2016-10-18T08:24:15Z","updated_at":"2016-10-18T08:24:15Z","body":"Done in pull request #314. "}}
{"actor":{"display_login":"d-michail"}}