https://www.adonaimedrado.pro.br/wiki/index.php?action=history&feed=atom&title=Solu%C3%A7%C3%A3o%3A_Problema_do_grafo_conexo_%28Jandson_Santos%29 2026-05-27T04:33:54Z Revision history for this page on the wiki MediaWiki 1.26.2 https://www.adonaimedrado.pro.br/wiki/index.php?title=Solu%C3%A7%C3%A3o:_Problema_do_grafo_conexo_(Jandson_Santos)&diff=2914&oldid=prev 2009-05-20T12:21:46Z

<p>New page: &lt;code lang=&quot;cpp&quot;&gt; #ifndef _VERTICE_H_ #define _VERTICE_H_ #include &lt;iostream&gt; #include &lt;vector&gt; using namespace std; class Vertice { private: vector&lt;int&gt; adjacencias; bo...</p> <p><b>New page</b></p><div>&lt;code lang=&quot;cpp&quot;&gt;<br /> <br /> #ifndef _VERTICE_H_<br /> #define _VERTICE_H_<br /> <br /> #include &lt;iostream&gt;<br /> #include &lt;vector&gt;<br /> <br /> using namespace std;<br /> <br /> class Vertice<br /> {<br /> private:<br /> vector&lt;int&gt; adjacencias;<br /> bool visitado;<br /> public:<br /> Vertice();<br /> void setAdjacencia(int x);<br /> int getAdjacencia(int x);<br /> bool consultaAdjacencia(int x);<br /> void setVisitado(bool x);<br /> bool getVisitado();<br /> unsigned int getQtdeAdjacencias();<br /> };<br /> <br /> #endif /*_VERTICE_H_*/<br /> <br /> Vertice::Vertice()<br /> {<br /> }<br /> <br /> void Vertice::setAdjacencia(int x)<br /> {<br /> adjacencias.push_back(x);<br /> }<br /> <br /> int Vertice::getAdjacencia(int x)<br /> {<br /> return adjacencias[x];<br /> }<br /> <br /> bool Vertice::consultaAdjacencia(int x)<br /> {<br /> int i;<br /> for(i=0; i&lt;((int) adjacencias.size()); i++)<br /> {<br /> if(adjacencias.at(i) == x)<br /> {<br /> return true;<br /> }<br /> }<br /> return false;<br /> }<br /> <br /> void Vertice::setVisitado(bool x)<br /> {<br /> visitado = x;<br /> }<br /> <br /> bool Vertice::getVisitado()<br /> {<br /> return visitado;<br /> }<br /> <br /> unsigned int Vertice::getQtdeAdjacencias()<br /> {<br /> return (int) adjacencias.size();<br /> }<br /> <br /> <br /> <br /> #ifndef _GRAFO_H_<br /> #define _GRAFO_H_<br /> <br /> #include &lt;iostream&gt;<br /> #include &lt;cstdlib&gt;<br /> #include &lt;vector&gt;<br /> #include &quot;Vertice.cpp&quot;<br /> <br /> using namespace std;<br /> <br /> class Grafo<br /> {<br /> private:<br /> vector&lt;Vertice&gt; lVertices;<br /> int tamGrafo;<br /> public:<br /> Grafo(int t);<br /> void lerEntradas(int qtde);<br /> Vertice getVertice(int i);<br /> int conexo();<br /> };<br /> <br /> #endif /*_GRAFO_H_*/<br /> <br /> Grafo::Grafo(int t)<br /> {<br /> int i;<br /> tamGrafo = t;<br /> for(i=0; i&lt;t; i++)<br /> {<br /> lVertices.push_back(Vertice());<br /> }<br /> }<br /> <br /> Vertice Grafo::getVertice(int i)<br /> {<br /> return lVertices[i];<br /> }<br /> <br /> void Grafo::lerEntradas(int qtde)<br /> {<br /> int x, y;<br /> while(qtde--)<br /> {<br /> cin &gt;&gt; x;<br /> cin &gt;&gt; y;<br /> lVertices[x].setAdjacencia(y);<br /> lVertices[y].setAdjacencia(x);<br /> }<br /> }<br /> <br /> int Grafo::conexo()<br /> {<br /> vector&lt;Vertice&gt; pilha;<br /> unsigned int i, y;<br /> Vertice topo;<br /> for(i=0; i&lt;lVertices.size(); i++)<br /> {<br /> lVertices[i].setVisitado(false);<br /> }<br /> pilha.clear();<br /> topo = lVertices[0];<br /> topo.setVisitado(true);<br /> pilha.push_back(topo);<br /> while (!pilha.empty())<br /> {<br /> topo = pilha.back();<br /> i=0;<br /> while(i&lt;topo.getQtdeAdjacencias())<br /> {<br /> y = topo.getAdjacencia(i);<br /> if (lVertices[y].getVisitado())<br /> {<br /> i++;<br /> }<br /> else<br /> {<br /> lVertices[y].setVisitado(true);<br /> pilha.push_back(lVertices[y]);<br /> topo = pilha.back();<br /> i=0;<br /> }<br /> }<br /> pilha.pop_back();<br /> }<br /> for(i=0; i&lt;((int) lVertices.size()); i++)<br /> {<br /> if (!lVertices[i].getVisitado())<br /> {<br /> return false;<br /> }<br /> }<br /> return true;<br /> }<br /> <br /> int main ()<br /> {<br /> int tamGrafo, qtdeArestas;<br /> cin &gt;&gt; tamGrafo;<br /> cin &gt;&gt; qtdeArestas;<br /> Grafo g(tamGrafo);<br /> g.lerEntradas(qtdeArestas);<br /> cout &lt;&lt; g.conexo() &lt;&lt; endl;<br /> }<br /> <br /> &lt;/code&gt;</div>

200.17.147.2