Graph representation
- Set of edges
- 不便于实现graph API(每次访问顶点的边都需要遍历)
- Adjacency-matrix
- space inefficient (N^2)
- Adjacency-list
- practical representation (V+2E?)
Graph challenges
- Graph bipartite
- Linear time
- Euler tour
- 哥尼斯堡七桥问题
- 给定一个图,能否找到一个环路,经过每条edge一次且仅一次
- Linear time
- Hamilton cycle
- 又称旅行者问题 (traveling salesman)
- 给定一个图,能否找到一个环路,经过每个vertex一次且仅一次
- NP问题
- Graph isomorphism
- Intractable