人工智能教程 - 数学基础课程1.5 - 离散数学-6,7 图论和图着色问题，NP完备性,匹配

图论

它们出现在各种应用中，调度，优化，通信，算法设计和分析。

They come up in all sorts of applications,scheduling,optimization,communications,the design and analysis of algorithms.

定义：

图G是一个二元组，通常称为(V, E),其中V是顶点或者结点的集合,E是 V X V的子集，称为边。

Def: A graph G is a pair of sets (V, E) where V is a nonempty set of elements called vertices or nodes.And E is a set of 2-item subsets and called edges.
V = { x 1 , x 2 , x 3 , . . . x 7 } V=\{ {x_1,x_2,x_3,...x_7} \} V={ x1​,x2​,x3​,...x7​}
E = { { x 1 , x 2 } , { x 1 , x 3 } , . . . { x 5 , x 7 } } E=\{ \{ x_1,x_2\},\{ x_1,x_3\},...\{ x_5,x_7\} \}