1. 예정

  • 1학기는 여기서 종강. 2학기는 있을 수도 없을 수도
  • 그래프(graph)
    • 링크(https://en.wikipedia.org/wiki/Graph_(abstract_data_type))
    • G = (V,E)
    • direct, undirect
    • simple, multi, pseudo
    • neighbor, degree(in, out), isolated, pendant
    • representations:
      • edge list
      • adjacency list
      • adjacency matrix
      • Incidence matrix
    • path, cycle(circuit), connectness
      • Euler path, Euler circuit, Hamilton ~
    • shortest path
      • weighted graph
      • Dijkstra's algorithm
        • 링크(https://ko.wikipedia.org/wiki/%EB%8D%B0%EC%9D%B4%ED%81%AC%EC%8A%A4%ED%8A%B8%EB%9D%BC_%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98)
    • traversal - spanning tree, BFS, DFS
      • minimum spanning tree
        • Prim's, Kruskkal's
    • TSP problem
  • ...근데 깃세미나가... 오늘도 펑

2. 진행


3. 실습

  • 아마 없을듯

4. 기타 / 후기 / 방명록

Retrieved from http://wiki.zeropage.org/wiki.php/새싹교실/2018/C알/5월29일
last modified 2021-02-07 05:30:09