mooigraph
/
regraphlet


			
				
					
						
						
							123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596
							<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: bid_dijkstra Class Reference</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    <li><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<div class="tabs">
  <ul>
    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  </ul>
</div>
<h1>bid_dijkstra Class Reference</h1><!-- doxytag: class="bid_dijkstra" --><!-- doxytag: inherits="algorithm" -->Dijkstra's Algorithm for computing a shortest path from a single source to a single target.  
<a href="#_details">More...</a>
<p>
<div class="dynheader">
Inheritance diagram for bid_dijkstra:</div>
<div class="dynsection">
<p><center><img src="a00120.gif" border="0" usemap="#a00121" alt="Inheritance graph"></center>
<map name="a00121">
<area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="12,7,89,31"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for bid_dijkstra:</div>
<div class="dynsection">
<p><center><img src="a00122.gif" border="0" usemap="#a00123" alt="Collaboration graph"></center>
<map name="a00123">
<area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="428,5,505,29"><area shape="rect" href="a00020.html" title="A node in a graph." alt="" coords="441,92,492,116"><area shape="rect" title="s\nt" alt="" coords="489,101,497,109"><area shape="rect" title="s\nt" alt="" coords="695,172,703,180"><area shape="rect" title="int_node" alt="" coords="437,91,445,99"><area shape="rect" title="int_node" alt="" coords="489,89,497,97"><area shape="rect" href="a00021.html" title="node_map\&lt; int \&gt;" alt="" coords="405,145,528,169"><area shape="rect" title="source_mark\ntarget_mark" alt="" coords="524,161,532,169"><area shape="rect" title="source_mark\ntarget_mark" alt="" coords="663,179,671,187"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="32,145,315,169"><area shape="rect" href="a00021.html" title="node_map\&lt; edge \&gt;" alt="" coords="397,204,536,228"><area shape="rect" title="pred\nsucc" alt="" coords="532,219,540,227"><area shape="rect" title="pred\nsucc" alt="" coords="683,197,691,205"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, edge, graph, allocator\&lt; edge \&gt; \&gt;" alt="" coords="16,204,331,228"><area shape="rect" href="a00011.html" title="edge_map\&lt; double \&gt;" alt="" coords="392,252,541,276"><area shape="rect" title="weight" alt="" coords="537,261,545,269"><area shape="rect" title="weight" alt="" coords="696,197,704,205"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, double, graph, allocator\&lt; double \&gt; \&gt;" alt="" coords="7,252,340,276"><area shape="rect" href="a00021.html" title="node_map\&lt; double \&gt;" alt="" coords="392,311,541,335"><area shape="rect" title="source_dist\ntarget_dist" alt="" coords="537,323,545,331"><area shape="rect" title="source_dist\ntarget_dist" alt="" coords="704,197,712,205"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, double, graph, allocator\&lt; double \&gt; \&gt;" alt="" coords="7,311,340,335"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>

<p>
<a href="a00124.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="da2e642d9f0582d30fe1dd51c4aa1899"></a><!-- doxytag: member="bid_dijkstra::shortest_path_node_iterator" ref="da2e642d9f0582d30fe1dd51c4aa1899" args="" -->
typedef list&lt; <a class="el" href="a00020.html">node</a> &gt;<br>
::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#da2e642d9f0582d30fe1dd51c4aa1899">shortest_path_node_iterator</a></td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Iterator type for traversing nodes on one shortest path. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="703d0faf9568bc25a9305faa61412fe1"></a><!-- doxytag: member="bid_dijkstra::shortest_path_edge_iterator" ref="703d0faf9568bc25a9305faa61412fe1" args="" -->
typedef list&lt; <a class="el" href="a00010.html">edge</a> &gt;<br>
::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#703d0faf9568bc25a9305faa61412fe1">shortest_path_edge_iterator</a></td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Iterator type for traversing edges on one shortest path. <br></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#1f9ddd95b88b24f45afe0966c2ae181b">bid_dijkstra</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Default constructor.  <a href="#1f9ddd95b88b24f45afe0966c2ae181b"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#a3151b5cc93e97be55a843d9a0641dbb">~bid_dijkstra</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Destructor.  <a href="#a3151b5cc93e97be55a843d9a0641dbb"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#25dfbd432043e2e642e4dc71f4cb3208">source_target</a> (const <a class="el" href="a00020.html">node</a> &amp;s, const <a class="el" href="a00020.html">node</a> &amp;t)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Sets source and target node.  <a href="#25dfbd432043e2e642e4dc71f4cb3208"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#33dd3a1cc5eb156b56a72235c9140e7d">weights</a> (const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;weight)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Sets weights of the edges.  <a href="#33dd3a1cc5eb156b56a72235c9140e7d"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#0032d9b44c8b3f6f5733ff3ef94cf169">store_path</a> (bool set)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Enables or disables the storing of the shortest path.  <a href="#0032d9b44c8b3f6f5733ff3ef94cf169"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#92c6790f5ea4a7417b593342c58a953b">check</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Checks whether the preconditions for bidirectional Dijkstra are satisfied.  <a href="#92c6790f5ea4a7417b593342c58a953b"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#1d2f36d3977ef90285442a269a03b919">run</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Runs shortest path <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> on <code>G</code>.  <a href="#1d2f36d3977ef90285442a269a03b919"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00020.html">node</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#0f86fdeb9adcd9677f96249cbd998dd2">source</a> () const </td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns source node.  <a href="#0f86fdeb9adcd9677f96249cbd998dd2"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00020.html">node</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#d5331c84cfdb357d9c42937b4b234c81">target</a> () const </td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns target node if set, <code><a class="el" href="a00020.html#82669b7358b50bd8d7888d7df4ff8dfa">node::node()</a></code> else.  <a href="#d5331c84cfdb357d9c42937b4b234c81"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#b5f65b4d4797b0d7d4e55b4b4513a709">store_path</a> () const </td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns whether the storing of the shortest path is enabled.  <a href="#b5f65b4d4797b0d7d4e55b4b4513a709"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#d25a1377f1f6ffa4e9d272ad6550a1e0">reached</a> () const </td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns whether target is reachable from source.  <a href="#d25a1377f1f6ffa4e9d272ad6550a1e0"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">double&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#583f79201cec68e2d52e592a885faef5">distance</a> () const </td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns the distance from source node to target node.  <a href="#583f79201cec68e2d52e592a885faef5"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00005.html#da2e642d9f0582d30fe1dd51c4aa1899">shortest_path_node_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#180d078fdae8023096c98bb91f00b902">shortest_path_nodes_begin</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns an iterator to the beginning (to the source node) of the shortest node path to target node.  <a href="#180d078fdae8023096c98bb91f00b902"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00005.html#da2e642d9f0582d30fe1dd51c4aa1899">shortest_path_node_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#ac4fa2382cb641f2db3b0137377e7bbb">shortest_path_nodes_end</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns an iterator one after the end (one after target node) of the shortest node path to target node.  <a href="#ac4fa2382cb641f2db3b0137377e7bbb"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00005.html#703d0faf9568bc25a9305faa61412fe1">shortest_path_edge_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#f5790a35a5833e83453d5f54463e86db">shortest_path_edges_begin</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns an iterator to the beginning edge of the shortest edge path to target node.  <a href="#f5790a35a5833e83453d5f54463e86db"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00005.html#703d0faf9568bc25a9305faa61412fe1">shortest_path_edge_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#dc1265143044f8270c02ed34ab46da7c">shortest_path_edges_end</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns an iterator one after the end of a shortest edge path to target node.  <a href="#dc1265143044f8270c02ed34ab46da7c"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00005.html#6ed0e7e34862ca44ae4f83eb3081ae3a">reset</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Resets Dijkstra's bidirectional <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a>.  <a href="#6ed0e7e34862ca44ae4f83eb3081ae3a"></a><br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
Dijkstra's Algorithm for computing a shortest path from a single source to a single target. 
<p>
<dl class="rcs" compact><dt><b>Date</b></dt><dd></dd></dl>
<dl class="rcs" compact><dt><b>Revision</b></dt><dd></dd></dl>
<p>
This class implements Dijkstra's <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> in a bidirectional manner for computing a shortest path from a single source to a single target in <img class="formulaInl" alt="$\mathcal{O}((|V| + |E|) log |V|)$" src="form_0.png"> worst case.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00009.html" title="Dijkstra&#39;s Algorithm for computing single source shortest path.">dijkstra</a> <p>
<a class="el" href="a00002.html" title="Bellman Ford algorithm.">bellman_ford</a></dd></dl>
<dl class="author" compact><dt><b>Author:</b></dt><dd>Christian Bachmaier <a href="mailto:chris@infosun.fmi.uni-passau.de">chris@infosun.fmi.uni-passau.de</a> </dd></dl>
<hr><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" name="1f9ddd95b88b24f45afe0966c2ae181b"></a><!-- doxytag: member="bid_dijkstra::bid_dijkstra" ref="1f9ddd95b88b24f45afe0966c2ae181b" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">bid_dijkstra::bid_dijkstra           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Default constructor. 
<p>
Enables only the calculation of shortest paths.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#b79e1ddec2f2afdf4b36b10724db8b15" title="Creates an algorithm object.">algorithm::algorithm</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="a3151b5cc93e97be55a843d9a0641dbb"></a><!-- doxytag: member="bid_dijkstra::~bid_dijkstra" ref="a3151b5cc93e97be55a843d9a0641dbb" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual bid_dijkstra::~bid_dijkstra           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Destructor. 
<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#dca9b1e7fa3afd914519a9dbb44e9fd5" title="Destroys the algorithm object.">algorithm::~algorithm</a> </dd></dl>

</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="25dfbd432043e2e642e4dc71f4cb3208"></a><!-- doxytag: member="bid_dijkstra::source_target" ref="25dfbd432043e2e642e4dc71f4cb3208" args="(const node &amp;s, const node &amp;t)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void bid_dijkstra::source_target           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>s</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>t</em></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Sets source and target node. 
<p>
Must be executed every time before check and run of this algorithm.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>s</em>&nbsp;</td><td>source node </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>t</em>&nbsp;</td><td>target node </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="33dd3a1cc5eb156b56a72235c9140e7d"></a><!-- doxytag: member="bid_dijkstra::weights" ref="33dd3a1cc5eb156b56a72235c9140e7d" args="(const edge_map&lt; double &gt; &amp;weight)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void bid_dijkstra::weights           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>weight</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Sets weights of the edges. 
<p>
This method <b>must</b> be called before check and run.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>weight</em>&nbsp;</td><td>weights of the edges </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="0032d9b44c8b3f6f5733ff3ef94cf169"></a><!-- doxytag: member="bid_dijkstra::store_path" ref="0032d9b44c8b3f6f5733ff3ef94cf169" args="(bool set)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void bid_dijkstra::store_path           </td>
          <td>(</td>
          <td class="paramtype">bool&nbsp;</td>
          <td class="paramname"> <em>set</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Enables or disables the storing of the shortest path. 
<p>
If enabled for every node and <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> on the shortest path from source to target will be stored.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>set</em>&nbsp;</td><td>true if path should be stored</td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00009.html#4885d97269ef954ea17047ebf8a697ab" title="Predecessor node of node n on the shortest path from the source node.">dijkstra::predecessor_node</a> <p>
<a class="el" href="a00009.html#f33f8c44fbe24f40e79c725b782b97dc" title="Predecessor edge of node n on the shortest path from the source node.">dijkstra::predecessor_edge</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="92c6790f5ea4a7417b593342c58a953b"></a><!-- doxytag: member="bid_dijkstra::check" ref="92c6790f5ea4a7417b593342c58a953b" args="(graph &amp;G)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual int bid_dijkstra::check           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Checks whether the preconditions for bidirectional Dijkstra are satisfied. 
<p>
The Precondition are that the weights of the edges have been set and that the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> has at least one node. Additionally all edge weights must be <img class="formulaInl" alt="$\ge 0$" src="form_1.png"> and and source and target nodes must be found in <code>G</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td><a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a></td></tr>
  </table>
</dl>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a></em>&nbsp;</td><td>if algorithm can be applied </td></tr>
    <tr><td valign="top"></td><td valign="top"><em><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">algorithm::GTL_ERROR</a></em>&nbsp;</td><td>otherwise</td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00009.html#9689f2628f76ddb3747ea18c91bd7041" title="Sets source node.">dijkstra::source</a> <p>
dijkstra::weigths <p>
<a class="el" href="a00001.html#76361fb03ad1cf643affc51821e43bed" title="Checks whether all preconditions are satisfied.">algorithm::check</a> </dd></dl>

<p>Implements <a class="el" href="a00001.html#76361fb03ad1cf643affc51821e43bed">algorithm</a>.</p>

</div>
</div><p>
<a class="anchor" name="1d2f36d3977ef90285442a269a03b919"></a><!-- doxytag: member="bid_dijkstra::run" ref="1d2f36d3977ef90285442a269a03b919" args="(graph &amp;G)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int bid_dijkstra::run           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Runs shortest path <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> on <code>G</code>. 
<p>
This should return always <a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a>. The return value only tracks errors that might occur. Afterwards the result of the test can be accessed via access methods.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td><a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a></td></tr>
  </table>
</dl>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a></em>&nbsp;</td><td>on success </td></tr>
    <tr><td valign="top"></td><td valign="top"><em><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">algorithm::GTL_ERROR</a></em>&nbsp;</td><td>otherwise</td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#734b189509a8d6b56b65f8ff772d43ca" title="Applies algorithm to graph g.">algorithm::run</a> </dd></dl>

<p>Implements <a class="el" href="a00001.html#734b189509a8d6b56b65f8ff772d43ca">algorithm</a>.</p>

</div>
</div><p>
<a class="anchor" name="0f86fdeb9adcd9677f96249cbd998dd2"></a><!-- doxytag: member="bid_dijkstra::source" ref="0f86fdeb9adcd9677f96249cbd998dd2" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00020.html">node</a> bid_dijkstra::source           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns source node. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>source node </dd></dl>

</div>
</div><p>
<a class="anchor" name="d5331c84cfdb357d9c42937b4b234c81"></a><!-- doxytag: member="bid_dijkstra::target" ref="d5331c84cfdb357d9c42937b4b234c81" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00020.html">node</a> bid_dijkstra::target           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns target node if set, <code><a class="el" href="a00020.html#82669b7358b50bd8d7888d7df4ff8dfa">node::node()</a></code> else. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>target node </dd></dl>

</div>
</div><p>
<a class="anchor" name="b5f65b4d4797b0d7d4e55b4b4513a709"></a><!-- doxytag: member="bid_dijkstra::store_path" ref="b5f65b4d4797b0d7d4e55b4b4513a709" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">bool bid_dijkstra::store_path           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns whether the storing of the shortest path is enabled. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd><code>true</code> iff the storing of path is enabled.</dd></dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd>dijkstra::predecessor </dd></dl>

</div>
</div><p>
<a class="anchor" name="d25a1377f1f6ffa4e9d272ad6550a1e0"></a><!-- doxytag: member="bid_dijkstra::reached" ref="d25a1377f1f6ffa4e9d272ad6550a1e0" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">bool bid_dijkstra::reached           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns whether target is reachable from source. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd><code>true</code> iff target was reached from source </dd></dl>

</div>
</div><p>
<a class="anchor" name="583f79201cec68e2d52e592a885faef5"></a><!-- doxytag: member="bid_dijkstra::distance" ref="583f79201cec68e2d52e592a885faef5" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">double bid_dijkstra::distance           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns the distance from source node to target node. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>distance if target is <a class="el" href="a00005.html#d25a1377f1f6ffa4e9d272ad6550a1e0" title="Returns whether target is reachable from source.">bid_dijkstra::reached</a>, <code>-1.0</code> else </dd></dl>

</div>
</div><p>
<a class="anchor" name="180d078fdae8023096c98bb91f00b902"></a><!-- doxytag: member="bid_dijkstra::shortest_path_nodes_begin" ref="180d078fdae8023096c98bb91f00b902" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00005.html#da2e642d9f0582d30fe1dd51c4aa1899">shortest_path_node_iterator</a> bid_dijkstra::shortest_path_nodes_begin           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns an iterator to the beginning (to the source node) of the shortest node path to target node. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>beginning node iterator of the shortest path</dd></dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00005.html#0032d9b44c8b3f6f5733ff3ef94cf169" title="Enables or disables the storing of the shortest path.">bid_dijkstra::store_path</a></dd></dl>
<dl class="note" compact><dt><b>Note:</b></dt><dd>The method requires that path calculation option was enabled during last run. </dd></dl>

</div>
</div><p>
<a class="anchor" name="ac4fa2382cb641f2db3b0137377e7bbb"></a><!-- doxytag: member="bid_dijkstra::shortest_path_nodes_end" ref="ac4fa2382cb641f2db3b0137377e7bbb" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00005.html#da2e642d9f0582d30fe1dd51c4aa1899">shortest_path_node_iterator</a> bid_dijkstra::shortest_path_nodes_end           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns an iterator one after the end (one after target node) of the shortest node path to target node. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>shortest path end node iterator</dd></dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00005.html#0032d9b44c8b3f6f5733ff3ef94cf169" title="Enables or disables the storing of the shortest path.">bid_dijkstra::store_path</a></dd></dl>
<dl class="note" compact><dt><b>Note:</b></dt><dd>The method requires that path calculation option was enabled during last run. </dd></dl>

</div>
</div><p>
<a class="anchor" name="f5790a35a5833e83453d5f54463e86db"></a><!-- doxytag: member="bid_dijkstra::shortest_path_edges_begin" ref="f5790a35a5833e83453d5f54463e86db" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00005.html#703d0faf9568bc25a9305faa61412fe1">shortest_path_edge_iterator</a> bid_dijkstra::shortest_path_edges_begin           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns an iterator to the beginning edge of the shortest edge path to target node. 
<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00005.html#0032d9b44c8b3f6f5733ff3ef94cf169" title="Enables or disables the storing of the shortest path.">bid_dijkstra::store_path</a></dd></dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>beginning edge iterator of the shortest path</dd></dl>
<dl class="note" compact><dt><b>Note:</b></dt><dd>The method requires that path calculation option was enabled during last run. </dd></dl>

</div>
</div><p>
<a class="anchor" name="dc1265143044f8270c02ed34ab46da7c"></a><!-- doxytag: member="bid_dijkstra::shortest_path_edges_end" ref="dc1265143044f8270c02ed34ab46da7c" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00005.html#703d0faf9568bc25a9305faa61412fe1">shortest_path_edge_iterator</a> bid_dijkstra::shortest_path_edges_end           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns an iterator one after the end of a shortest edge path to target node. 
<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00005.html#0032d9b44c8b3f6f5733ff3ef94cf169" title="Enables or disables the storing of the shortest path.">bid_dijkstra::store_path</a></dd></dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>shortest path end edge iterator</dd></dl>
<dl class="note" compact><dt><b>Note:</b></dt><dd>The method requires that predecessor calculation option was enabled during last run. </dd></dl>

</div>
</div><p>
<a class="anchor" name="6ed0e7e34862ca44ae4f83eb3081ae3a"></a><!-- doxytag: member="bid_dijkstra::reset" ref="6ed0e7e34862ca44ae4f83eb3081ae3a" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual void bid_dijkstra::reset           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Resets Dijkstra's bidirectional <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a>. 
<p>
It prepares the <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> to be applied again, possibly to another <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>.<p>
<dl class="note" compact><dt><b>Note:</b></dt><dd>The weights are not reset. You can apply this algorithms</dd></dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#21aba63d066ae7897de6ca7d8425c408" title="Resets algorithm.">algorithm::reset</a> </dd></dl>

<p>Implements <a class="el" href="a00001.html#21aba63d066ae7897de6ca7d8425c408">algorithm</a>.</p>

</div>
</div><p>
    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>