{"action":"opened","issue":{"url":"https://api.github.com/repos/sortsimilar/PAT/issues/40","repository_url":"https://api.github.com/repos/sortsimilar/PAT","labels_url":"https://api.github.com/repos/sortsimilar/PAT/issues/40/labels{/name}","comments_url":"https://api.github.com/repos/sortsimilar/PAT/issues/40/comments","events_url":"https://api.github.com/repos/sortsimilar/PAT/issues/40/events","html_url":"https://github.com/sortsimilar/PAT/issues/40","id":357676149,"node_id":"MDU6SXNzdWUzNTc2NzYxNDk=","number":40,"title":"拓扑排序（Topological Sorting）","user":{"login":"sortsimilar","id":26841985,"node_id":"MDQ6VXNlcjI2ODQxOTg1","avatar_url":"https://avatars0.githubusercontent.com/u/26841985?v=4","gravatar_id":"","url":"https://api.github.com/users/sortsimilar","html_url":"https://github.com/sortsimilar","followers_url":"https://api.github.com/users/sortsimilar/followers","following_url":"https://api.github.com/users/sortsimilar/following{/other_user}","gists_url":"https://api.github.com/users/sortsimilar/gists{/gist_id}","starred_url":"https://api.github.com/users/sortsimilar/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/sortsimilar/subscriptions","organizations_url":"https://api.github.com/users/sortsimilar/orgs","repos_url":"https://api.github.com/users/sortsimilar/repos","events_url":"https://api.github.com/users/sortsimilar/events{/privacy}","received_events_url":"https://api.github.com/users/sortsimilar/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-09-06T14:16:49Z","updated_at":"2018-09-06T14:16:49Z","closed_at":null,"author_association":"OWNER","body":"\r\n  1.  每个顶点出现且只出现一次。\r\n   2. 若存在一条从顶点 A 到顶点 B 的路径，那么在序列中顶点 A 出现在顶点 B 的前面。\r\n"}}
{"actor":{"display_login":"sortsimilar"}}