1*404b540aSrobert<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" 2*404b540aSrobert "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> 3*404b540aSrobert 4*404b540aSrobert<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"> 5*404b540aSrobert<head> 6*404b540aSrobert <meta name="generator" content= 7*404b540aSrobert "HTML Tidy for Linux/x86 (vers 12 April 2005), see www.w3.org" /> 8*404b540aSrobert 9*404b540aSrobert <title>Examples</title> 10*404b540aSrobert <meta http-equiv="Content-Type" content= 11*404b540aSrobert "text/html; charset=us-ascii" /> 12*404b540aSrobert </head> 13*404b540aSrobert 14*404b540aSrobert<body> 15*404b540aSrobert <div id="page"> 16*404b540aSrobert <h1>Priority-Queue Examples</h1> 17*404b540aSrobert 18*404b540aSrobert <h2><a name="basic_usage" id="basic_usage">Basic Use</a></h2> 19*404b540aSrobert 20*404b540aSrobert <ol> 21*404b540aSrobert <li><a href= 22*404b540aSrobert "../../../../testsuite/ext/pb_ds/example/basic_priority_queue.cc"><tt>basic_priority_queue.cc</tt></a> 23*404b540aSrobert Basic use of priority queues.</li> 24*404b540aSrobert 25*404b540aSrobert <li><a href= 26*404b540aSrobert "../../../../testsuite/ext/pb_ds/example/priority_queue_split_join.cc"><tt>priority_queue_split_join.cc</tt></a> 27*404b540aSrobert Splitting and joining priority queues.</li> 28*404b540aSrobert 29*404b540aSrobert <li><a href= 30*404b540aSrobert "../../../../testsuite/ext/pb_ds/example/priority_queue_erase_if.cc"><tt>priority_queue_erase_if.cc</tt></a> 31*404b540aSrobert Conditionally erasing values from a container object.</li> 32*404b540aSrobert </ol> 33*404b540aSrobert 34*404b540aSrobert <h2><a name="generics" id="generics">Generics</a></h2> 35*404b540aSrobert 36*404b540aSrobert <ol> 37*404b540aSrobert <li><a href= 38*404b540aSrobert "../../../../testsuite/ext/pb_ds/example/priority_queue_container_traits.cc"><tt>priority_queue_container_traits.cc</tt></a> 39*404b540aSrobert Using <a href="pq_container_traits.html"><tt>container_traits</tt></a> 40*404b540aSrobert to query about underlying data structure behavior.</li> 41*404b540aSrobert </ol> 42*404b540aSrobert 43*404b540aSrobert <h2><a name="xref" id="xref">Cross Referencing</a></h2> 44*404b540aSrobert 45*404b540aSrobert 46*404b540aSrobert <ol> 47*404b540aSrobert <li><a href= 48*404b540aSrobert "../../../../testsuite/ext/pb_ds/example/priority_queue_xref.cc"><tt>priority_queue_xref.cc</tt></a> 49*404b540aSrobert Cross referencing an associative container and a priority 50*404b540aSrobert queue.</li> 51*404b540aSrobert 52*404b540aSrobert <li><a href= 53*404b540aSrobert "../../../../testsuite/ext/pb_ds/example/priority_queue_dijkstra.cc"><tt>priority_queue_dijkstra.cc</tt></a> 54*404b540aSrobert Cross referencing a vector and a priority queue using a 55*404b540aSrobert <u>very</u> simple version of Dijkstra's shortest path 56*404b540aSrobert algorithm.</li> 57*404b540aSrobert </ol> 58*404b540aSrobert </div> 59*404b540aSrobert</body> 60*404b540aSrobert</html> 61