http://programmingexamples.net/w/index.php?action=history&feed=atom&title=CPP%2FBoost%2FHeap%2FIndirectCompare 2026-08-04T01:12:26Z Revision history for this page on the wiki MediaWiki 1.23.5 http://programmingexamples.net/w/index.php?title=CPP/Boost/Heap/IndirectCompare&diff=5183&oldid=prev 2012-09-05T21:35:05Z

<p>Created page with &#039;&lt;syntaxhighlight lang=&quot;cpp&quot;&gt; #include &lt;boost/heap/binomial_heap.hpp&gt; #include &lt;boost/pending/indirect_cmp.hpp&gt; #include &lt;boost/array.hpp&gt; #include &lt;boost/graph/grid_graph.hpp&gt; #i…&#039;</p> <p><b>New page</b></p><div>&lt;syntaxhighlight lang=&quot;cpp&quot;&gt;<br /> #include &lt;boost/heap/binomial_heap.hpp&gt;<br /> #include &lt;boost/pending/indirect_cmp.hpp&gt;<br /> #include &lt;boost/array.hpp&gt;<br /> #include &lt;boost/graph/grid_graph.hpp&gt;<br /> #include &lt;iostream&gt;<br /> <br /> int main(int, char*[])<br /> {<br /> boost::array&lt;std::size_t, 2&gt; lengths = { { 2,2 } };<br /> typedef boost::grid_graph&lt;2&gt; GraphType;<br /> GraphType graph(lengths);<br /> typedef boost::graph_traits&lt;GraphType&gt;::vertex_descriptor Vertex;<br /> typedef boost::property_map&lt;GraphType, boost::vertex_index_t&gt;::const_type GridIndexMapType;<br /> GridIndexMapType gridIndexMap(get(boost::vertex_index, graph));<br /> <br /> typedef boost::graph_traits&lt;GraphType&gt;::vertex_iterator VertexIteratorType;<br /> VertexIteratorType vertexIterator, vertexIteratorEnd;<br /> <br /> typedef boost::vector_property_map&lt;float, GridIndexMapType&gt; PriorityMapType;<br /> PriorityMapType priorityMap(gridIndexMap);<br /> <br /> typedef boost::indirect_cmp&lt;PriorityMapType, std::less&lt;float&gt; &gt; IndirectComparisonType;<br /> IndirectComparisonType indirectComparison(priorityMap);<br /> <br /> typedef boost::heap::binomial_heap&lt;Vertex, boost::heap::stable&lt;false&gt;, boost::heap::compare&lt;IndirectComparisonType&gt; &gt; PriorityQueueType;<br /> PriorityQueueType pq(indirectComparison);<br /> <br /> typedef typename PriorityQueueType::handle_type handle_t;<br /> <br /> for( tie(vertexIterator, vertexIteratorEnd) = vertices(graph); vertexIterator != vertexIteratorEnd; ++vertexIterator)<br /> {<br /> put(priorityMap, *vertexIterator, rand() % 1000);<br /> pq.push(*vertexIterator);<br /> }<br /> <br /> // Change all of the priorities in the map<br /> for( tie(vertexIterator, vertexIteratorEnd) = vertices(graph); vertexIterator != vertexIteratorEnd; ++vertexIterator)<br /> {<br /> put(priorityMap, *vertexIterator, rand() % 1000);<br /> }<br /> <br /> // Resort the queue<br /> for( tie(vertexIterator, vertexIteratorEnd) = vertices(graph); vertexIterator != vertexIteratorEnd; ++vertexIterator)<br /> {<br /> // pq.update(handle3, 5);<br /> }<br /> <br /> // Output the final queue<br /> while(!pq.empty())<br /> {<br /> Vertex v = pq.top();<br /> std::cout &lt;&lt; v[0] &lt;&lt; &quot; &quot; &lt;&lt; v[1] &lt;&lt; std::endl;<br /> pq.pop();<br /> }<br /> <br /> return 0;<br /> }<br /> <br /> &lt;/syntaxhighlight&gt;</div>

Daviddoria