http://158.108.32.49/wiki/index.php?action=history&feed=atom&title=Algo_lab%2Ftopological_ordering 2026-05-06T17:52:09Z ประวัติรุ่นแก้ไขของหน้านี้ในวิกิ MediaWiki 1.33.1 http://158.108.32.49/wiki/index.php?title=Algo_lab/topological_ordering&diff=59402&oldid=prev 2022-11-11T08:02:39Z

<p>สร้างหน้าด้วย &quot;&lt;syntaxhighlight lang=&quot;cpp&quot;&gt; #include &lt;iostream&gt; #include &lt;vector&gt; using namespace std; const int MAX_N = 110; vector&lt;int&gt; adj[MAX_N]; int indeg[MAX_N...&quot;</p> <p><b>หน้าใหม่</b></p><div>&lt;syntaxhighlight lang=&quot;cpp&quot;&gt;<br /> #include &lt;iostream&gt;<br /> #include &lt;vector&gt;<br /> <br /> using namespace std;<br /> <br /> const int MAX_N = 110;<br /> <br /> vector&lt;int&gt; adj[MAX_N];<br /> int indeg[MAX_N];<br /> int outdeg[MAX_N];<br /> int n,m;<br /> <br /> vector&lt;int&gt; output;<br /> <br /> void read_input()<br /> {<br /> cin &gt;&gt; n &gt;&gt; m;<br /> if((n == 0) &amp;&amp; (m==0))<br /> return;<br /> <br /> for(int i=0; i&lt;n; i++) {<br /> indeg[i] = outdeg[i] = 0;<br /> adj[i].clear();<br /> }<br /> <br /> for(int i=0; i&lt;m; i++) {<br /> int u,v;<br /> cin &gt;&gt; u &gt;&gt; v; u--; v--;<br /> adj[u].push_back(v);<br /> indeg[v]++;<br /> outdeg[u]++;<br /> }<br /> }<br /> <br /> void topo_order()<br /> {<br /> vector&lt;int&gt; s;<br /> <br /> output.clear();<br /> <br /> for(int u=0; u&lt;n; u++)<br /> if(indeg[u] == 0)<br /> s.push_back(u);<br /> <br /> for(int i=0; i&lt;n; i++) {<br /> int u = s.back();<br /> s.pop_back();<br /> output.push_back(u);<br /> <br /> for(int d=0; d &lt; outdeg[u]; d++) {<br /> int v = adj[u][d];<br /> indeg[v]--;<br /> if(indeg[v] == 0) {<br /> s.push_back(v);<br /> }<br /> }<br /> }<br /> }<br /> <br /> int main()<br /> {<br /> }<br /> <br /> &lt;/syntaxhighlight&gt;</div>

Jittat