{"id":504,"date":"2019-08-20T17:59:14","date_gmt":"2019-08-20T09:59:14","guid":{"rendered":"http:\/\/47.101.202.111\/?p=504"},"modified":"2023-04-07T16:13:57","modified_gmt":"2023-04-07T08:13:57","slug":"dfs-appliance","status":"publish","type":"post","link":"http:\/\/139.196.114.170\/?p=504","title":{"rendered":"\u76f2\u76ee\u641c\u7d22 &#8211; DFS\u601d\u60f3\u53ca\u5e94\u7528"},"content":{"rendered":"<h3>DFS\u7406\u89e3<\/h3>\n<p>DFS\u5c06\u95ee\u9898\u62bd\u8c61\u4e3a\u72b6\u6001\u4e0e\u76f8\u90bb\u72b6\u6001\u4e4b\u95f4\u7684\u5173\u7cfb<\/p>\n<p>\u5229\u7528\u7cfb\u7edf\u6808\u5b8c\u6210\u9012\u5f52\u8c03\u7528<\/p>\n<p>\u8c03\u7528\u5c55\u5f00\u7ed3\u6784\u662f\u76f8\u90bb\u8282\u70b9\u6570\u91cf\u4e3an\u7684 <strong>n\u53c9\u9012\u5f52\u6811<\/strong><\/p>\n<p>\u5229\u7528\u8c03\u7528\u8f68\u8ff9\u53ef\u7528\u4e8e\u56fe\u76f8\u5173\u7b97\u6cd5\u548c\u679a\u4e3e<\/p>\n<h3>DFS\u7b97\u6cd5\u6982\u8981<\/h3>\n<pre><code class=\"language-cpp\">    void DFS(Node &amp;n) {\n        for(Node &amp;x: n -&gt; neighbors) {\n            if(visited_set[x].count() &lt;= 0) {\n                visited_set.insert(x);\n                DFS(x);\n            }\n        }\n    }<\/code><\/pre>\n<h3>DFS\u975e\u9012\u5f52\u5b9e\u73b0<\/h3>\n<h3>DFS\u5224\u65ad\u8fde\u901a\u6027<\/h3>\n<pre><code class=\"language-cpp\">\n    ...\n    DFS(start, target);\n    ...\n\n    void DFS(Node &amp;n, Node &amp;target)\n    {\n        if(n == target)\n            isConnected = true;\n        for...\n    }<\/code><\/pre>\n<h3>DFS\u5229\u7528\u6808\u8bb0\u5f55\u8fde\u901a\u8def\u5f84<\/h3>\n<pre><code class=\"language-cpp\">\n    ...\n    for(Node &amp;start: graph)\n        if(visited_set.count(start) &lt;= 0)\n            DFS(start, target);\n    ...\n\n    void DFS(Node n, Node &amp;target)\n    {\n        path_vector.push_back(n);\n        visited_set.insert(n);\n\n        if(n == target)\n        {\n            isConnected = true;\n            print(path_vector);\n            path_vector.pop_back();\n        }\n\n        for(Node &amp;x: n-&gt;neighbors)\n            if(visited_set.count(x) &lt;= 0)\n                DFS(x, target);\n\n        path_vector.pop_back();\n    }\n<\/code><\/pre>\n<h3>DFS\u5229\u7528\u6811\u8bb0\u5f55\u8fde\u901a\u8def\u5f84<\/h3>\n<pre><code class=\"language-cpp\">\n    ...\n    for(Node &amp;start: graph)\n        if(visited_set.count(start) &lt;= 0)\n            DFS(start, target);\n    ...\n\n    void DFS(Node &amp;n, Node &amp;target)\n    {\n        if(n == target)\n        {\n            for(Node x = n; x != start; x = root_map[x])\n                tmp_stack.push();\n\n            for(!tmp_stack.empty())\n            {\n                print(tmp_stack.top());\n                tmp_stack.pop();\n            }\n        }\n\n        for(Node &amp;x: n -&gt; neighbors)\n        {\n            if(visited_set.count(x) &lt;= 0)\n            {\n                root_map[x] = n;\n                DFS(x, target);\n            }\n        }\n    }\n<\/code><\/pre>\n<h3>DFS\u6c42\u8fde\u901a\u5206\u91cf\u4e2a\u6570<\/h3>\n<pre><code class=\"language-cpp\">\n    ...\n    for(Node &amp;start: graph)\n        if(visited_set.count(start) &lt;= 0)\n        {\n            DFS(start);\n            count++;\n        }\n    ...\n\n    void DFS(Node &amp;n)\n    {\n        for(Node &amp;x: n -&gt; neighbors)\n            if(visited_set.count(x) &lt;= 0)\n                DFS(x);\n    }<\/code><\/pre>\n<h3>DFS\u6c42\u8fde\u901a\u5206\u91cf\u4e2d\u5143\u7d20\u4e2a\u6570<\/h3>\n<pre><code class=\"language-cpp\">\n    ...\n    for(Node &amp;start: graph)\n        if(visited_set.count(start) &lt;= 0)\n        {\n            int i = 0;\n            DFS(start, i);\n            count_vector.push_back(i);\n        }\n    ...\n\n    void DFS(Node &amp;n, int &amp;i)\n    {\n        i++;\n        for(Node &amp;x: n -&gt; neighbors)\n            if(visited_set.count(x) &lt;= 0)\n                DFS(x, i);\n    }<\/code><\/pre>\n<h3>DFS\u5224\u65ad\u662f\u5426\u65e0\u5411\u6709\u73af\u56fe<\/h3>\n<pre><code class=\"language-cpp\">\n    ...\n    for(Node &amp;start: graph)\n        if(visited_set.count(start) &lt;= 0)\n            DFS(start, start);\n    ...\n\n    void DFS(Node &amp;n, Node &amp;nRoot)\n    {\n        for(Node &amp;x: n -&gt; neighbors)\n        {\n            if(visited_set.count(x) &lt;= 0)\n                DFS(x, n);\n\n            else if(x != nRoot)\n                hasCycle = true;\n        }\n    }<\/code><\/pre>\n<h3>DFS\u5224\u65ad\u662f\u5426\u4e8c\u5206\u56fe<\/h3>\n<pre><code class=\"language-cpp\">\n    ...\n    for(Node &amp;start: graph)\n        if(visited_set.count(start) &lt;= 0)\n            DFS(start);\n    ...\n\n    void DFS(Node &amp;n)\n    {\n        for(Node &amp;x: n -&gt; neighbors)\n        {\n            if(visited_set.count(x) &lt;= 0)\n            {\n                x -&gt; color = ! n -&gt; color;\n                DFS(x);\n            }\n\n            else if(n -&gt; color == x -&gt; color)\n                isBipartite = false;\n        }\n    }<\/code><\/pre>\n<h3>DFS\u5b9e\u73b0\u62d3\u6251\u6392\u5e8f<\/h3>\n<ul>\n<li>\u62d3\u6251\u6392\u5e8f<\/li>\n<\/ul>\n<p>\u5c06\u6709\u5411\u56fe\u8f93\u51fa\u4e3a\u5e8f\u5217\uff0c\u8be5\u5e8f\u5217\u6ee1\u8db3\u56fe\u4e2d\u7684\u6240\u6709\u524d\u9a71\u8282\u70b9\u4e00\u5b9a\u6392\u5728\u5176\u540e\u7ee7\u7ed3\u70b9\u4e4b\u524d<\/p>\n<ul>\n<li>\u601d\u60f3\u5206\u6790<\/li>\n<\/ul>\n<p>\u8282\u70b9 <code class=\"katex-inline\">\\scriptsize cur<\/code> \u4e3a\u6839\u8282\u70b9\u7684\u56fe <code class=\"katex-inline\">\\scriptsize G(cur)<\/code>\uff0c\u5176\u524d\u5e8f\u904d\u5386\u6216\u540e\u5e8f\u904d\u5386\u7684\u5012\u5e8f\u4e00\u5b9a\u662f\u62d3\u6251\u5e8f\u5217<\/p>\n<p>\u95ee\u9898\u662f\u904d\u5386\u6574\u5f20\u56fe\u65f6\uff0c\u4e0d\u4e00\u5b9a\u80fd\u4fdd\u8bc1\u524d\u5e8f\u8282\u70b9\u5148\u8bbf\u95ee\uff1a\u5982\u56fe <code class=\"katex-inline\">\\scriptsize G(pre) = pre \\rightarrow G(cur)<\/code>\uff0c\u53ef\u80fd\u5148\u8bbf\u95ee\u5230\u540e\u7ee7\u8282\u70b9 <code class=\"katex-inline\">\\scriptsize cur<\/code> \u6267\u884c\u5b50\u56fe <code class=\"katex-inline\">\\scriptsize G(cur)<\/code> \u904d\u5386\uff0c\u540e\u8bbf\u95ee\u5230\u524d\u9a71\u8282\u70b9 <code class=\"katex-inline\">\\scriptsize pre<\/code>\uff0c\u6b64\u65f6\u7834\u574f\u4e86\u62d3\u6251\u987a\u5e8f\u3002\u56e0\u6b64\u524d\u5e8f\u904d\u5386\u7b56\u7565\u4ec5\u4fdd\u8bc1\u5b50\u56fe\u7684\u8bbf\u95ee\u662f\u62d3\u6251\u5e8f\u5217\uff0c\u4e0d\u4fdd\u8bc1\u5168\u56fe\u7684\u8bbf\u95ee\u987a\u5e8f\u6ee1\u8db3\u524d\u5e8f\u5173\u7cfb<\/p>\n<p>\u4f46\u6ce8\u610f\u5230\u4e00\u4e2a\u6027\u8d28\uff1a\u5148\u8bbf\u95ee\u5230\u540e\u7ee7\u8282\u70b9 <code class=\"katex-inline\">\\scriptsize cur<\/code> \u65f6\uff0c<code class=\"katex-inline\">\\scriptsize G(cur) \\rightarrow pre<\/code> \u7684\u5012\u5e8f\u662f <code class=\"katex-inline\">\\scriptsize G(pre) = pre \\rightarrow G(cur)<\/code> \u7684\u62d3\u6251\u5e8f\uff1b\u5148\u8bbf\u95ee\u5230\u524d\u5e8f\u8282\u70b9 <code class=\"katex-inline\">\\scriptsize pre<\/code> \u65f6\uff0c\u540e\u5e8f\u904d\u5386\u7684\u5012\u5e8f\u662f <code class=\"katex-inline\">\\scriptsize G(pre) = pre \\rightarrow G(cur)<\/code> \u7684\u62d3\u6251\u5e8f\u3002\u7efc\u4e0a\u5f97\u51fa\uff0c\u91c7\u7528\u540e\u5e8f\u904d\u5386\u7b56\u7565\u65f6\uff0c\u5012\u5e8f\u5e8f\u5217\u4e00\u5b9a\u662f\u5168\u56fe\u7684\u62d3\u6251\u5e8f\uff0c\u4e0e\u8282\u70b9\u7684\u8bbf\u95ee\u987a\u5e8f\u65e0\u5173<\/p>\n<pre><code class=\"language-cpp\">\n    ...\n    for(Node &amp;node: graph)\n        if(visited_set.count(node) &lt;= 0)\n            DFS(node);\n\n    for(int i = sort_vector.size(); i &gt;= 0; i--)\n        print(sort_vector[i]);\n    ...\n\n    void DFS(Node &amp;n)\n    {\n        for(Node &amp;x: n -&gt; neighbors)\n            if(visited_set.count(x) &lt;= 0)\n                DFS(x);\n\n        sort_vector.push_back(n);\n    }<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>DFS\u7406\u89e3 DFS\u5c06\u95ee\u9898\u62bd\u8c61\u4e3a\u72b6\u6001\u4e0e\u76f8\u90bb\u72b6\u6001\u4e4b\u95f4\u7684\u5173\u7cfb \u5229\u7528\u7cfb\u7edf\u6808\u5b8c\u6210\u9012\u5f52\u8c03\u7528 \u8c03\u7528\u5c55\u5f00\u7ed3\u6784\u662f\u76f8\u90bb\u8282\u70b9\u6570\u91cf\u4e3an &hellip; <\/p>\n<p class=\"link-more\"><a href=\"http:\/\/139.196.114.170\/?p=504\" class=\"more-link\">\u7ee7\u7eed\u9605\u8bfb<span class=\"screen-reader-text\">\u201c\u76f2\u76ee\u641c\u7d22 &#8211; DFS\u601d\u60f3\u53ca\u5e94\u7528\u201d<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[12],"tags":[16,15,14],"jetpack_featured_media_url":"","_links":{"self":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/504"}],"collection":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=504"}],"version-history":[{"count":55,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/504\/revisions"}],"predecessor-version":[{"id":2742,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/504\/revisions\/2742"}],"wp:attachment":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=504"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=504"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=504"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}