mooigraph
/
regraphlet


			
				
					
						
						
							12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
							<!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: Member List</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>node_map&lt; T, Alloc &gt; Member List</h1>This is the complete list of members for <a class="el" href="a00021.html">node_map&lt; T, Alloc &gt;</a>, including all inherited members.<p><table>
  <tr class="memlist"><td><a class="el" href="a00019.html#ebe555c23769c6dcc869b5ac7fae6a9c">clear</a>()</td><td><a class="el" href="a00019.html">ne_map&lt; node, T, graph, Alloc &gt;</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00019.html#4ef2ab4aebcb57a7a101975bf6a88e24">init</a>(const graph &amp;, Tdef=T())</td><td><a class="el" href="a00019.html">ne_map&lt; node, T, graph, Alloc &gt;</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00019.html#cbe94c2209408e8af27fb9580251f360">ne_map</a>()</td><td><a class="el" href="a00019.html">ne_map&lt; node, T, graph, Alloc &gt;</a></td><td><code> [protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00019.html#769ee373d4cd8d3ef2c1577372da149c">ne_map</a>(const graph &amp;g, Tdef=T())</td><td><a class="el" href="a00019.html">ne_map&lt; node, T, graph, Alloc &gt;</a></td><td><code> [explicit, protected]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00021.html#7a4c767f07f348d31a1004776485d17b">node_map</a>()</td><td><a class="el" href="a00021.html">node_map&lt; T, Alloc &gt;</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00021.html#5bd24349e3a56379592889abbe4c6b09">node_map</a>(const graph &amp;g, T t=T())</td><td><a class="el" href="a00021.html">node_map&lt; T, Alloc &gt;</a></td><td><code> [inline, explicit]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00019.html#4bcfa7ec2dcbfaa42fab93dfa81e8ab0">operator[]</a>(nodekey)</td><td><a class="el" href="a00019.html">ne_map&lt; node, T, graph, Alloc &gt;</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00019.html#1b6fd0142573c9140de20dcc43c5aa55">operator[]</a>(nodekey) const </td><td><a class="el" href="a00019.html">ne_map&lt; node, T, graph, Alloc &gt;</a></td><td></td></tr>
</table>    <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>