{"action":"opened","issue":{"url":"https://api.github.com/repos/zh-f/elbarco.cn/issues/2","repository_url":"https://api.github.com/repos/zh-f/elbarco.cn","labels_url":"https://api.github.com/repos/zh-f/elbarco.cn/issues/2/labels{/name}","comments_url":"https://api.github.com/repos/zh-f/elbarco.cn/issues/2/comments","events_url":"https://api.github.com/repos/zh-f/elbarco.cn/issues/2/events","html_url":"https://github.com/zh-f/elbarco.cn/issues/2","id":348273500,"node_id":"MDU6SXNzdWUzNDgyNzM1MDA=","number":2,"title":"Basic Graph Algorithms","user":{"login":"zh-f","id":11818216,"node_id":"MDQ6VXNlcjExODE4MjE2","avatar_url":"https://avatars1.githubusercontent.com/u/11818216?v=4","gravatar_id":"","url":"https://api.github.com/users/zh-f","html_url":"https://github.com/zh-f","followers_url":"https://api.github.com/users/zh-f/followers","following_url":"https://api.github.com/users/zh-f/following{/other_user}","gists_url":"https://api.github.com/users/zh-f/gists{/gist_id}","starred_url":"https://api.github.com/users/zh-f/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/zh-f/subscriptions","organizations_url":"https://api.github.com/users/zh-f/orgs","repos_url":"https://api.github.com/users/zh-f/repos","events_url":"https://api.github.com/users/zh-f/events{/privacy}","received_events_url":"https://api.github.com/users/zh-f/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-08-07T11:06:31Z","updated_at":"2018-08-07T11:06:31Z","closed_at":null,"author_association":"OWNER","body":"# Basic Graph Algorithms\r\n\r\n## Graphs\r\n\r\n图是一种用于表示节点（又被称为顶点，vertex）与边的连通性的抽象方式。通常我们把节点标注为V<sub>1</sub>,V<sub>2</sub>...V<sub>n</sub>，用E来表示边。顶点用于展示对象或者存储数据，边连接了成对的顶点，来建立对象的连接关系。根据边是否有向，来区分图是有向图（directed）还是无向图，区别如下：\r\n\r\n![directed-and-undirected-graph.png](imgs/directed-and-undirected-graph.png)\r\n\r\n一般来讲，我们用` G = (V, E) `来表示一个图，V表示顶点的集合，E表示顶点上的二元关系，如果一条边是从顶点`u`到顶点`v`，那么E就包含一个有序对` (u, v) `。\r\n那么，对于上图a来讲，有向图的表示为：\r\n* V = {1, 2, 3, 4}\r\n* E = {(1, 2),(1, 3),(1, 4),(2, 3),(2, 4),(3, 2),(3, 4)}\r\n对于上图b来讲，无向图的表示为：\r\n* V = {1, 2, 3, 4}\r\n* E = {(1, 2),(1, 3),(1, 4),(2, 3),(2, 4),(3, 4)}\r\n\r\n\r\n## Why Study Graphs?\r\n\r\n## Storing Graphs\r\n\r\n### Adjacency Matrix\r\n\r\n### Adjacency List\r\n\r\n## Special Graphs\r\n\r\n## Depth-First and Breadth-First Search (DFS and BFS)\r\n\r\n## Topological Sort\r\n\r\n## ...\r\n"}}
{"actor":{"display_login":"zh-f"}}