{"id":5326,"date":"2017-01-18T12:28:23","date_gmt":"2017-01-18T11:28:23","guid":{"rendered":"http:\/\/smart--grid.net\/?page_id=5326"},"modified":"2022-12-03T23:00:24","modified_gmt":"2022-12-03T22:00:24","slug":"m1-ne-first-half-2016","status":"publish","type":"page","link":"https:\/\/complex-systems-ai.com\/en\/graph-theory-2\/m1-ne-first-half-2016\/","title":{"rendered":"M1 NE First Half 2016"},"content":{"rendered":"<div data-elementor-type=\"wp-page\" data-elementor-id=\"5326\" class=\"elementor elementor-5326\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-6a0a05ef elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"6a0a05ef\" data-element_type=\"section\" data-e-type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-337057b7\" data-id=\"337057b7\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-3841dadb elementor-widget elementor-widget-text-editor\" data-id=\"3841dadb\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<div class=\"openbig\">\u00a0<\/div><ul><li><a title=\"reading0\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/05\/lecture01.pdf\">reading0<\/a>: Introduction to decision making, design, implementation, complexity<\/li><li><a title=\"lecture1_course\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/08\/lecture1_course.pdf\">reading1<\/a>: Graph theory, Eulerian, Hamiltonian, Spanning tree &amp; Graph coloring<ul><li><em><a title=\"Practice1_1\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice1_1.pdf\">Practice1_1<\/a>: Basic examples on graph theory<\/em><\/li><li><em><a title=\"Practice1_2\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice1_2.pdf\">Practice1_2<\/a>: Minimal spanning tree (Prim)<\/em><\/li><li><em><a title=\"Practice1_3\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice1_3.pdf\">Practice1_3<\/a>: Minimal Spanning tree (Kruskal)<\/em><\/li><li><em><a title=\"Practice1_4\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice1_4.pdf\">Practice1_4<\/a>: graph coloring, Sudoku<\/em><ul><li><em><a title=\"Tutorial1\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/03\/tutorial1.pdf\">Tutorial1<\/a>: Modeling and basics<\/em><\/li><li><a title=\"tutorial1-fix\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/10\/tutorial1-correction.pdf\">Tutorial1-solutions<\/a><ul><li><a href=\"https:\/\/www.youtube.com\/watch?v=cplfcGZmX7I\" target=\"_blank\" rel=\"noopener\">Prim&#039;s Algorithm Video<\/a><\/li><li><a href=\"https:\/\/www.youtube.com\/watch?v=71UQH7Pr9kU\" target=\"_blank\" rel=\"noopener\">Kruskal&#039;s Algorithm Video<\/a><\/li><\/ul><\/li><\/ul><\/li><\/ul><\/li><li><a title=\"lecture2_course\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/08\/lecture2_course.pdf\">reading2<\/a>: Paradigm, Divide &amp; Conquer, Dynamic programming<ul><li><a title=\"Practice2_1\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice2_11.pdf\">Practice2_1<\/a>: Divide &amp; Conquer Binary search algorithm<\/li><li><a title=\"Practice2_2\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice2_2.pdf\">Practice2_2<\/a>: Dynamic programming, the coin changing problem (simple and all combinations)<ul><li><em><a title=\"Tutorial2\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/03\/tutorial2.pdf\">Tutorial2<\/a>: Paradigm<\/em><\/li><li><a title=\"tutorial2-correction\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/09\/tutorial2-correction.pdf\">Tutorial2-solutions<\/a><\/li><\/ul><\/li><\/ul><\/li><li><a title=\"lecture3_course\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/08\/lecture3_course.pdf\">reading3<\/a>: Shortest path problem, <a href=\"https:\/\/complex-systems-ai.com\/en\/graph-theory-path-search\/algorithm-of-dijkstra\/\">Dijkstra<\/a>, DAG, <a href=\"https:\/\/complex-systems-ai.com\/en\/graph-theory-path-search\/ford-bellman-algorithm\/\">Ford Bellman<\/a>, <a href=\"https:\/\/complex-systems-ai.com\/en\/graph-theory-path-search\/floyd-warshall-transitive-closure-algorithm\/\">Floyd\u2013Warshall<\/a><ul><li><a title=\"Practice3_1\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice3_1.pdf\">Practice3_1<\/a>: Step by step Dijkstra&#039;s algorithm<\/li><li><a title=\"Practice3_2\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice3_2.pdf\">Practice3_2<\/a>: Step by step Ford-Bellman&#039;s algorithm<\/li><li><a title=\"Practice3_3\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice3_3.pdf\">Practice3_3<\/a>: Step by step transitive closure and Floyd-Warshall&#039;s algorithm<ul><li><em><a title=\"Tutorial3\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/03\/tutorial3.pdf\">Tutorial3<\/a>: Shortest path<\/em><\/li><li><a title=\"tutorial3-correction\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/09\/tutorial3-correction.pdf\">Tutorial3-solutions<\/a><ul><li id=\"module-18414\" class=\"activity url modtype_url\"><div id=\"yui_3_17_2_2_1478610929652_355\"><div id=\"yui_3_17_2_2_1478610929652_354\" class=\"mod-indent-outer\"><div id=\"yui_3_17_2_2_1478610929652_353\"><div id=\"yui_3_17_2_2_1478610929652_352\" class=\"activityinstance\"><a id=\"yui_3_17_2_2_1478610929652_358\" class=\"\" href=\"https:\/\/www.youtube.com\/watch?v=8Ls1RqHCOPw\" target=\"_blank\" rel=\"noopener\">Dijkstra&#039;s Algorithm video<\/a><\/div><\/div><\/div><\/div><\/li><li id=\"module-18412\" class=\"activity url modtype_url\"><div id=\"yui_3_17_2_2_1478610929652_364\"><div id=\"yui_3_17_2_2_1478610929652_363\" class=\"mod-indent-outer\"><div id=\"yui_3_17_2_2_1478610929652_361\" class=\"activityinstance\"><a id=\"yui_3_17_2_2_1478610929652_360\" class=\"\" href=\"https:\/\/www.youtube.com\/watch?v=iTW2yFYd1Nc\" target=\"_blank\" rel=\"noopener\">Bellman-Ford Algorithm video<\/a><\/div><\/div><\/div><\/li><li id=\"module-18413\" class=\"activity url modtype_url\"><div id=\"yui_3_17_2_2_1478610929652_370\"><div id=\"yui_3_17_2_2_1478610929652_369\" class=\"mod-indent-outer\"><div id=\"yui_3_17_2_2_1478610929652_367\" class=\"activityinstance\"><a id=\"yui_3_17_2_2_1478610929652_366\" class=\"\" href=\"https:\/\/www.youtube.com\/watch?v=KQ9zlKZ5Rzc\" target=\"_blank\" rel=\"noopener\">Floyd-Warshall Algorithm video<\/a><\/div><\/div><\/div><\/li><\/ul><\/li><\/ul><\/li><\/ul><\/li><li><a title=\"lecture4_course\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/08\/lecture4_course.pdf\">reading4<\/a>: Min cut problem, Max flow problem, augmenting path problem, <a href=\"https:\/\/complex-systems-ai.com\/en\/maximum-flow-problem\/ford-fulkerson-algorithm\/\">Ford-Fulkerson<\/a><ul><li><a title=\"Practice4_1\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice4_1.pdf\">Practice4_1<\/a>: Step by step Ford-Fulkerson&#039;s algorithm<\/li><li><a title=\"Practice4_2\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/04\/practice4_2.pdf\">Practice4_2<\/a>: Min-cut problem<ul><li><em><a title=\"Tutorial4\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/03\/tutorial4.pdf\">Tutorial4<\/a>: Flow problem<\/em><\/li><li><a title=\"tutorial4-correction\" href=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/09\/tutorial4-correction.pdf\">Tutorial4-solutions<\/a><ul><li><a href=\"https:\/\/www.youtube.com\/watch?v=hmIrJCGPPG4\" target=\"_blank\" rel=\"noopener\">Ford-Fulkerson Algorithm video<\/a><\/li><\/ul><\/li><\/ul><\/li><\/ul><\/li><\/ul>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"<p>lecture0: Introduction to decision making, design, implementation, complexity lecture1: Graph theory, Eulerian, Hamiltonian, Spanning tree &amp; Graph coloring Practice1_1: Basic examples on graph theory Practice1_2: \u2026 <\/p>","protected":false},"author":1,"featured_media":0,"parent":2204,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-5326","page","type-page","status-publish","hentry"],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages\/5326","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/comments?post=5326"}],"version-history":[{"count":25,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages\/5326\/revisions"}],"predecessor-version":[{"id":18552,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages\/5326\/revisions\/18552"}],"up":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/pages\/2204"}],"wp:attachment":[{"href":"https:\/\/complex-systems-ai.com\/en\/wp-json\/wp\/v2\/media?parent=5326"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}