Sophie

Sophie

distrib > Mageia > 4 > i586 > media > core-release > by-pkgid > 2a90dcd9dfcd284ddf6dc3b0a0b0bf47 > files > 381

steghide-0.5.1-17.mga4.i586.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.5"/>
<title>steghide: DFSAPHeuristic Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">steghide
   &#160;<span id="projectnumber">0.5.1</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.5 -->
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="hierarchy.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-methods">Private Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="classDFSAPHeuristic-members.html">List of all members</a>  </div>
  <div class="headertitle">
<div class="title">DFSAPHeuristic Class Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>a matching algorithm implementing a heuristic search for augmenting paths  
 <a href="classDFSAPHeuristic.html#details">More...</a></p>

<p><code>#include &lt;<a class="el" href="DFSAPHeuristic_8h_source.html">DFSAPHeuristic.h</a>&gt;</code></p>
<div class="dynheader">
Inheritance diagram for DFSAPHeuristic:</div>
<div class="dyncontent">
 <div class="center">
  <img src="classDFSAPHeuristic.png" usemap="#DFSAPHeuristic_map" alt=""/>
  <map id="DFSAPHeuristic_map" name="DFSAPHeuristic_map">
<area href="classMatchingAlgorithm.html" alt="MatchingAlgorithm" shape="rect" coords="0,0,117,24"/>
</map>
 </div></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ab0d70281dd13170430076bb6bf7e6d9d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#ab0d70281dd13170430076bb6bf7e6d9d">DFSAPHeuristic</a> (<a class="el" href="classGraph.html">Graph</a> *g, <a class="el" href="classMatching.html">Matching</a> *m, float goal=100.0, <a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne=<a class="el" href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a>, <a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a> mo=<a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a>)</td></tr>
<tr class="separator:ab0d70281dd13170430076bb6bf7e6d9d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a995ea2e59f6b27143da1efa3799c68f4"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a995ea2e59f6b27143da1efa3799c68f4">~DFSAPHeuristic</a> (void)</td></tr>
<tr class="separator:a995ea2e59f6b27143da1efa3799c68f4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8ee345a8b89cbc8cf4f4ef7d8305ff6d"><td class="memItemLeft" align="right" valign="top">const char *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a8ee345a8b89cbc8cf4f4ef7d8305ff6d">getName</a> (void) const </td></tr>
<tr class="separator:a8ee345a8b89cbc8cf4f4ef7d8305ff6d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa32cf73dfea46c56170ab93d038aa1bb"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#aa32cf73dfea46c56170ab93d038aa1bb">reset</a> (<a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> mne=<a class="el" href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a>, <a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a> mo=<a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a>)</td></tr>
<tr class="separator:aa32cf73dfea46c56170ab93d038aa1bb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6be8de5d724975d145500fc7a1f12198"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a6be8de5d724975d145500fc7a1f12198">run</a> (void)</td></tr>
<tr class="separator:a6be8de5d724975d145500fc7a1f12198"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="inherit_header pub_methods_classMatchingAlgorithm"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classMatchingAlgorithm')"><img src="closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="classMatchingAlgorithm.html">MatchingAlgorithm</a></td></tr>
<tr class="memitem:ae8cd854b438d0d4b90dce63296a29961 inherit pub_methods_classMatchingAlgorithm"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classMatchingAlgorithm.html#ae8cd854b438d0d4b90dce63296a29961">MatchingAlgorithm</a> (<a class="el" href="classGraph.html">Graph</a> *g, <a class="el" href="classMatching.html">Matching</a> *m, float goal)</td></tr>
<tr class="separator:ae8cd854b438d0d4b90dce63296a29961 inherit pub_methods_classMatchingAlgorithm"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a263bc490ed5abf59bb6fa0336cacd9da inherit pub_methods_classMatchingAlgorithm"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classMatchingAlgorithm.html#a263bc490ed5abf59bb6fa0336cacd9da">~MatchingAlgorithm</a> (void)</td></tr>
<tr class="separator:a263bc490ed5abf59bb6fa0336cacd9da inherit pub_methods_classMatchingAlgorithm"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a85ed2292f5a0eb016b419aaaf35b68f7 inherit pub_methods_classMatchingAlgorithm"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classMatching.html">Matching</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classMatchingAlgorithm.html#a85ed2292f5a0eb016b419aaaf35b68f7">getMatching</a> (void) const </td></tr>
<tr class="separator:a85ed2292f5a0eb016b419aaaf35b68f7 inherit pub_methods_classMatchingAlgorithm"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae6fa3917ebacc51dcf465a173d8d42a3 inherit pub_methods_classMatchingAlgorithm"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classMatchingAlgorithm.html#ae6fa3917ebacc51dcf465a173d8d42a3">setGoal</a> (float goal)</td></tr>
<tr class="separator:ae6fa3917ebacc51dcf465a173d8d42a3 inherit pub_methods_classMatchingAlgorithm"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a2046bacf3bdd3468cd5732bb7544a090"><td class="memItemLeft" align="right" valign="top">unsigned long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a2046bacf3bdd3468cd5732bb7544a090">searchAugmentingPath</a> (<a class="el" href="classVertex.html">Vertex</a> *v0, const <a class="el" href="classEdge.html">Edge</a> **path)</td></tr>
<tr class="separator:a2046bacf3bdd3468cd5732bb7544a090"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8fbae63f1ab832aacf5c432e1270589e"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="classEdge.html">Edge</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a8fbae63f1ab832aacf5c432e1270589e">getNextEdge</a> (<a class="el" href="classVertex.html">Vertex</a> *v)</td></tr>
<tr class="separator:a8fbae63f1ab832aacf5c432e1270589e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a88358a5e013978a2211d6cc94cbc19e8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a88358a5e013978a2211d6cc94cbc19e8">markVisited</a> (<a class="el" href="classVertex.html">Vertex</a> *v)</td></tr>
<tr class="separator:a88358a5e013978a2211d6cc94cbc19e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a64e8f25fe3d703673d4e32531eb53ff0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a64e8f25fe3d703673d4e32531eb53ff0">isVisited</a> (<a class="el" href="classVertex.html">Vertex</a> *v) const </td></tr>
<tr class="separator:a64e8f25fe3d703673d4e32531eb53ff0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a43559467d5f822ecaf739b215bb64441"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a43559467d5f822ecaf739b215bb64441">isVisited</a> (<a class="el" href="common_8h.html#ab9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a> vlbl) const </td></tr>
<tr class="separator:a43559467d5f822ecaf739b215bb64441"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a58332cda0fbc79a94ff15b2715cdb59e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a58332cda0fbc79a94ff15b2715cdb59e">TimeCounter</a></td></tr>
<tr class="separator:a58332cda0fbc79a94ff15b2715cdb59e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aef8179c11e9f17f0499281ff4ea04a57"><td class="memItemLeft" align="right" valign="top"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#aef8179c11e9f17f0499281ff4ea04a57">TimeCounters</a></td></tr>
<tr class="separator:aef8179c11e9f17f0499281ff4ea04a57"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a25fe18d2559609eab338ab4c2fffd9fc"><td class="memItemLeft" align="right" valign="top">bool *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#a25fe18d2559609eab338ab4c2fffd9fc">VertexOnPath</a></td></tr>
<tr class="separator:a25fe18d2559609eab338ab4c2fffd9fc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa31f7a99d7771193e274d962c2841a2c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classEdgeIterator.html">EdgeIterator</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classDFSAPHeuristic.html#aa31f7a99d7771193e274d962c2841a2c">EdgeIterators</a></td></tr>
<tr class="separator:aa31f7a99d7771193e274d962c2841a2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="inherited"></a>
Additional Inherited Members</h2></td></tr>
<tr class="inherit_header pro_attribs_classMatchingAlgorithm"><td colspan="2" onclick="javascript:toggleInherit('pro_attribs_classMatchingAlgorithm')"><img src="closed.png" alt="-"/>&#160;Protected Attributes inherited from <a class="el" href="classMatchingAlgorithm.html">MatchingAlgorithm</a></td></tr>
<tr class="memitem:a3af20bc23311e6165f81d5064f1d0404 inherit pro_attribs_classMatchingAlgorithm"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classGraph.html">Graph</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classMatchingAlgorithm.html#a3af20bc23311e6165f81d5064f1d0404">TheGraph</a></td></tr>
<tr class="separator:a3af20bc23311e6165f81d5064f1d0404 inherit pro_attribs_classMatchingAlgorithm"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7f048641a6db4e92258f7b118fac33b0 inherit pro_attribs_classMatchingAlgorithm"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classMatching.html">Matching</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classMatchingAlgorithm.html#a7f048641a6db4e92258f7b118fac33b0">TheMatching</a></td></tr>
<tr class="separator:a7f048641a6db4e92258f7b118fac33b0 inherit pro_attribs_classMatchingAlgorithm"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aec9ec46a32f1afcd67b338d54ddb0e1c inherit pro_attribs_classMatchingAlgorithm"><td class="memItemLeft" align="right" valign="top">unsigned long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classMatchingAlgorithm.html#aec9ec46a32f1afcd67b338d54ddb0e1c">CardinalityGoal</a></td></tr>
<tr class="separator:aec9ec46a32f1afcd67b338d54ddb0e1c inherit pro_attribs_classMatchingAlgorithm"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>This class implements the heuristic augmenting path search presented by Rolf H. Moehring and Matthias Mueller-Hannemann in their paper: "Cardinality
Matching: Heuristic Search for Augmenting Paths". </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a class="anchor" id="ab0d70281dd13170430076bb6bf7e6d9d"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">DFSAPHeuristic::DFSAPHeuristic </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classGraph.html">Graph</a> *&#160;</td>
          <td class="paramname"><em>g</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classMatching.html">Matching</a> *&#160;</td>
          <td class="paramname"><em>m</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">float&#160;</td>
          <td class="paramname"><em>goal</em> = <code>100.0</code>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a>&#160;</td>
          <td class="paramname"><em>mne</em> = <code><a class="el" href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a></code>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a>&#160;</td>
          <td class="paramname"><em>mo</em> = <code><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a></code>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>construct an <a class="el" href="classDFSAPHeuristic.html" title="a matching algorithm implementing a heuristic search for augmenting paths ">DFSAPHeuristic</a> object </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">g</td><td>the graph on which this heuristic should run </td></tr>
    <tr><td class="paramname">m</td><td>the matching to start with </td></tr>
    <tr><td class="paramname">goal</td><td>the percentage of matched vertices that should be reached </td></tr>
    <tr><td class="paramname">mne</td><td>the maximum number of edges that should be considered for every vertex </td></tr>
    <tr><td class="paramname">mo</td><td>the mode for edge iteration </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="a995ea2e59f6b27143da1efa3799c68f4"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">DFSAPHeuristic::~DFSAPHeuristic </td>
          <td>(</td>
          <td class="paramtype">void&#160;</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a class="anchor" id="a8ee345a8b89cbc8cf4f4ef7d8305ff6d"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const char* DFSAPHeuristic::getName </td>
          <td>(</td>
          <td class="paramtype">void&#160;</td>
          <td class="paramname"></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Implements <a class="el" href="classMatchingAlgorithm.html#a7305edae5d74e91987bcf983b2a1171a">MatchingAlgorithm</a>.</p>

</div>
</div>
<a class="anchor" id="a8fbae63f1ab832aacf5c432e1270589e"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="classEdge.html">Edge</a> * DFSAPHeuristic::getNextEdge </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classVertex.html">Vertex</a> *&#160;</td>
          <td class="paramname"><em>v</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="a64e8f25fe3d703673d4e32531eb53ff0"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool DFSAPHeuristic::isVisited </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classVertex.html">Vertex</a> *&#160;</td>
          <td class="paramname"><em>v</em></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>returns true iff v has already been visited in this iteration, i.e. in the current call of searchAugmentingPath </p>

</div>
</div>
<a class="anchor" id="a43559467d5f822ecaf739b215bb64441"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool DFSAPHeuristic::isVisited </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="common_8h.html#ab9c88dfaf90b738f73f1700aa77d06ef">VertexLabel</a>&#160;</td>
          <td class="paramname"><em>vlbl</em></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="a88358a5e013978a2211d6cc94cbc19e8"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void DFSAPHeuristic::markVisited </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classVertex.html">Vertex</a> *&#160;</td>
          <td class="paramname"><em>v</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="aa32cf73dfea46c56170ab93d038aa1bb"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void DFSAPHeuristic::reset </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a>&#160;</td>
          <td class="paramname"><em>mne</em> = <code><a class="el" href="common_8h.html#a7c5e1100effed542218f9eff1db76b6a">UWORD32_MAX</a></code>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06f">EdgeIterator::ITERATIONMODE</a>&#160;</td>
          <td class="paramname"><em>mo</em> = <code><a class="el" href="classEdgeIterator.html#a1e6b8b43d1620445bf945f667a38f06fa6406f55724d4783ed9a29dc26ffbafc6">EdgeIterator::SAMPLEOCCURENCE</a></code>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">
<p>reset the state of this <a class="el" href="classDFSAPHeuristic.html" title="a matching algorithm implementing a heuristic search for augmenting paths ">DFSAPHeuristic</a>, esp. the EdgeIterators </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">mne</td><td>the maximum number of edges that should be considered for every vertex for now on </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="a6be8de5d724975d145500fc7a1f12198"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void DFSAPHeuristic::run </td>
          <td>(</td>
          <td class="paramtype">void&#160;</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Implements <a class="el" href="classMatchingAlgorithm.html#aeea6c808daf03fd788c9a9feea885c41">MatchingAlgorithm</a>.</p>

</div>
</div>
<a class="anchor" id="a2046bacf3bdd3468cd5732bb7544a090"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">unsigned long DFSAPHeuristic::searchAugmentingPath </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classVertex.html">Vertex</a> *&#160;</td>
          <td class="paramname"><em>v0</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="classEdge.html">Edge</a> **&#160;</td>
          <td class="paramname"><em>path</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">v0</td><td>an exposed vertex </td></tr>
    <tr><td class="paramname">path</td><td>an array of <a class="el" href="classEdge.html">Edge</a> pointers where the path will be put </td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the length of the path (the number of valid edges in path) </dd></dl>

</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a class="anchor" id="aa31f7a99d7771193e274d962c2841a2c"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classEdgeIterator.html">EdgeIterator</a>* DFSAPHeuristic::EdgeIterators</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="a58332cda0fbc79a94ff15b2715cdb59e"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a> DFSAPHeuristic::TimeCounter</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="aef8179c11e9f17f0499281ff4ea04a57"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="common_8h.html#a6b8592979b076e06aa233e3f586ac999">UWORD32</a>* DFSAPHeuristic::TimeCounters</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="a25fe18d2559609eab338ab4c2fffd9fc"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool* DFSAPHeuristic::VertexOnPath</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="DFSAPHeuristic_8h_source.html">DFSAPHeuristic.h</a></li>
<li><a class="el" href="DFSAPHeuristic_8cc.html">DFSAPHeuristic.cc</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Oct 18 2013 17:59:37 for steghide by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.5
</small></address>
</body>
</html>

Perl :: Catalyst :: PostgreSQL :: RPM Valid HTML 4.01 Transitional