3.1 Boolean Algebra 1. Boolean algebra布尔代数 Boolean expression布尔表达式 Boolean operator布尔运算符 2. complement补码 Complementary operation求反运算
1 3.1 Boolean Algebra 1. Boolean algebra 布尔代数 Boolean expression 布尔表达式 Boolean operator 布尔运算符 2. complement 补码 Complementary operation 求反运算
3. unon并集 比较 intersect交 difference差 negation 非 5. vector向量
2 3. union 并集 比较 intersect 交 difference 差 4. negation 非 5. vector 向量
3.2 Graph Theory 1. vertex顶点 2.edge边 3. graph图 If any two nodes in a graph can be connected by a path along edges, the graph is said to be connected.如果图中任意两 个结点间都能够用一条路径沿着边线连接起来,那么该 图则被称为连通的
3 3.2 Graph Theory 1. vertex 顶点 2. edge 边 3. graph 图 If any two nodes in a graph can be connected by a path along edges, the graph is said to be connected. 如果图中任意两 个结点间都能够用一条路径沿着边线连接起来，那么该 图则被称为连通的
A subgraph is a subset of the nodes and edges within a graph子图是图中结点和边线的子集。 A graph is directed( a digraph) if each edge links two lodes together only in one direction如果每条边线仅在 个方向上将两个结点连接起来,则该图为有向图。 a graph is weighted if each edge has some value associated with it如果每条边线都有一些相关的值,则该图为加 权图
4 A subgraph is a subset of the nodes and edges within a graph. 子图是图中结点和边线的子集。 A graph is directed( a digraph ) if each edge links two nodes together only in one direction. 如果每条边线仅在 一个方向上将两个结点连接起来，则该图为有向图。 A graph is weighted if each edge has some value associated with it. 如果每条边线都有一些相关的值，则该图为加 权图
4.Loon循环 loop check循环检测 loop configuration循环配置 loop structure循环结构 5. circuit n.电路 circuit board电路板
5 4. Loop n. v. 循环 loop check 循环检测 loop configuration 循环配置 loop structure 循环结构 5. circuit n. 电路 circuit board 电路板