http://www.programmingexamples.net/w/index.php?action=history&feed=atom&title=Boost%2FBGL%2FEdgeExists 2026-06-10T11:26:53Z Revision history for this page on the wiki MediaWiki 1.23.5 http://www.programmingexamples.net/w/index.php?title=Boost/BGL/EdgeExists&diff=5019&oldid=prev 2011-11-16T12:48:07Z

<p>moved <a href="/wiki/CPP/Boost/BGL/EdgeExists" class="mw-redirect" title="CPP/Boost/BGL/EdgeExists">CPP/Boost/BGL/EdgeExists</a> to <a href="/wiki/Boost/BGL/EdgeExists" title="Boost/BGL/EdgeExists">Boost/BGL/EdgeExists</a></p> <table class='diff diff-contentalign-left'> <tr style='vertical-align: top;'> <td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 12:48, 16 November 2011</td> </tr><tr><td colspan='2' style='text-align: center;'><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

Daviddoria http://www.programmingexamples.net/w/index.php?title=Boost/BGL/EdgeExists&diff=4540&oldid=prev 2011-06-14T01:11:26Z

<p>Created page with &#039;==EdgeExists.cpp== &lt;source lang=&quot;cpp&quot;&gt; #include &lt;iostream&gt; #include &lt;boost/graph/adjacency_list.hpp&gt; typedef boost::adjacency_list&lt;boost::vecS, boost::vecS, boost::undirectedS&gt; …&#039;</p> <p><b>New page</b></p><div>==EdgeExists.cpp==<br /> &lt;source lang=&quot;cpp&quot;&gt;<br /> #include &lt;iostream&gt;<br /> #include &lt;boost/graph/adjacency_list.hpp&gt;<br /> <br /> typedef boost::adjacency_list&lt;boost::vecS, boost::vecS, boost::undirectedS&gt; Graph;<br /> <br /> int main(int,char*[])<br /> {<br /> // Create a graph object<br /> Graph g;<br /> Graph::vertex_descriptor v0 = boost::add_vertex(g);<br /> Graph::vertex_descriptor v1 = boost::add_vertex(g);<br /> <br /> // Check if an edge between v0 and v1 exists. It should not at this point.<br /> std::cout &lt;&lt; &quot;Edge exists?&quot; &lt;&lt; boost::edge(v0, v1, g).second &lt;&lt; std::endl; // false<br /> <br /> // Add an edge between v0 and v1.<br /> std::pair&lt;Graph::edge_descriptor, bool&gt; e0 = boost::add_edge(v0, v1, g);<br /> <br /> // Check again if an edge between v0 and v1 exists. It should now.<br /> std::cout &lt;&lt; &quot;Edge exists?&quot; &lt;&lt; boost::edge(v0, v1, g).second &lt;&lt; std::endl; // true<br /> <br /> // A demonstration of the full return type of edge(). At this point, retrievedEdge.first<br /> // should be exactly equal to e0<br /> std::pair&lt;Graph::edge_descriptor, bool&gt; retrievedEdge = boost::edge(v0, v1, g);<br /> <br /> return 0;<br /> }<br /> <br /> &lt;/source&gt;<br /> <br /> ==CMakeLists.txt==<br /> &lt;source lang=&quot;cmake&quot;&gt;<br /> cmake_minimum_required(VERSION 2.6)<br /> <br /> Project(EdgeExists)<br /> <br /> set(Boost_USE_MULTITHREADED ON)<br /> FIND_PACKAGE(Boost 1.38 COMPONENTS required)<br /> <br /> INCLUDE_DIRECTORIES(${INCLUDE_DIRECTORIES} ${Boost_INCLUDE_DIRS})<br /> LINK_DIRECTORIES(${LINK_DIRECTORIES} ${Boost_LIBRARY_DIRS})<br /> <br /> ADD_EXECUTABLE(EdgeExists EdgeExists.cpp)<br /> <br /> &lt;/source&gt;</div>

Daviddoria