1. CH05 Graph
   1. define
      1. vertices,頂點
      2. edges,邊
      3. adjacent,相鄰
      4. path
      5. cycle,環路
      6. subgraph
      7. connected graph
      8. degree
         1. indegree
         2. outdegree
      9. undirected graph
         1. connected graph
         2. complete graph
      10. directed graph
          1. head
          2. tail
          3. strongly connected graph
          4. complete graph
   2. adjacency matrix
      1. 無向圖
         1. 一定是對稱矩陣
      2. 有向圖
         1. 不一定是對稱矩陣
      3. 對角線一定為零
   3. adjacency list
      1. 無向圖
         1. 總節點數是邊數兩倍
            1. 因為是雙向
      2. 有向圖
         1. 總節點數等於邊數
   4. weighted graph
   5. traversal
      1. Breadth First Search
         1. 水波
            1. queue
      2. Depth First Search
         1. 河流
            1. stack
   6. spanning tree
      1. kruskal 演算法
      2. prim 演算法
   7. Short Path
      1. Dijkstra
         1. Cost[V][V]
         2. Dist[V]
         3. Prior[V]
         4. Decided[V]
      2. Floyd
         1. A[0]
         2. P[0]
2. CH06 Tree
   1. tree
      1. internal node
         1. non-terminal node
            1. branch
      2. external node
         1. terminal node
            1. leaf
      3. parent node
      4. child node
         1. siblings
      5. level
         1. hight
      6. forest
   2. binary tree
      1. V=E+1
      2. 2 children
      3. level i
         1. 2^(i-1)
      4. hight k
         1. (2^k) -1
      5. full binary tree
      6. formal binary tree
      7. complete binary tree
      8. store
         1. one dimensional array
         2. linked list
      9. creation of binary tree
         1. ABDH000E00CF00G00
      10. binary tree traversals
          1. preorder traverse
             1. ABC
          2. inorder traverse
             1. BAC
          3. postorder traverse
             1. BCA