https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=%EC%83%88%EC%8B%B9%EA%B5%90%EC%8B%A4%2F2018%2FC%EC%95%8C%2F5%EC%9B%9429%EC%9D%BC 2026-05-15T01:47:23Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=%EC%83%88%EC%8B%B9%EA%B5%90%EC%8B%A4/2018/C%EC%95%8C/5%EC%9B%9429%EC%9D%BC&diff=59214&oldid=prev 2018-05-29T08:30:11Z

<p>{CREATE}</p> <p><b>New page</b></p><div>__TOC__<br /> = 예정 =<br /> * 1학기는 여기서 종강. 2학기는 있을 수도 없을 수도<br /> * 그래프(graph)<br /> ** [https://en.wikipedia.org/wiki/Graph_(abstract_data_type)|링크]<br /> ** G = (V,E)<br /> ** direct, undirect<br /> ** simple, multi, pseudo<br /> ** neighbor, degree(in, out), isolated, pendant<br /> ** representations:<br /> ** edge list<br /> ** adjacency list<br /> ** adjacency matrix <br /> ** Incidence matrix<br /> ** path, cycle(circuit), connectness<br /> ** Euler path, Euler circuit, Hamilton ~<br /> ** shortest path<br /> ** weighted graph<br /> ** Dijkstra&#039;s algorithm<br /> *** [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|링크]<br /> ** traversal - spanning tree, BFS, DFS<br /> ** minimum spanning tree<br /> *** Prim&#039;s, Kruskkal&#039;s<br /> ** TSP problem<br /> * ...근데 깃세미나가... 오늘도 펑<br /> = 진행 =<br /> <br /> = 실습 =<br /> * 아마 없을듯<br /> = 기타 / 후기 / 방명록 =<br /> <br /> -----------------------------------<br /> [[새싹교실/2018/C알]]<br /> [[새싹교실/2018]]<br /> </div>

165.194.17.177