Inicio Explorar Ayuda
Iniciar sesión
mooigraph
/
regraphlet
Seguir 1
Destacar 0
Fork 0
Archivos Incidencias 0 Pull Requests 0 Wiki
Rama: master
Ramas Etiquetas
regraphlet
/
orig
/
GTL-1.2.4
/
doc
/
manual
/
inherits.html

inherits.html 6.8 KB
Permalink Histórico Raw

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889 
  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
    2. 

  2. <html>
    3. 

  3.   <head>
    4. 

  4.     <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
    5. 

  5.       <title>GTL - Graph Template Library: Graphical Class Hierarchy</title>
    6. 

  6.       <link href="doxygen.css" rel="stylesheet" type="text/css">
    7. 

  7.   </head>
    8. 

  8.   <body>
    9. 

  9.     <p class="links">  
    10. 

  10.       <a href="../index.html">Home</a> |
    11. 

  11.       Documentation |
    12. 

  12.       <a href="../register.html">Download</a> |
    13. 

  13.       <a href="../platforms.html">Platforms</a> |
    14. 

  14.       <a href="../refer.html">Projects</a> |      
    15. 

  15.       <a href="../lists.html">Mailing Lists</a> |
    16. 

  16.       <a href="../history.html">Version History</a>
    17. 

  17.     </p>
    18. 

  18. 

  19. <!-- Generated by Doxygen 1.5.3 -->
    20. 

  20. <div class="tabs">
    21. 

  21.   <ul>
    22. 

  22.     <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    23. 

  23.     <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    24. 

  24.     <li><a href="files.html"><span>Files</span></a></li>
    25. 

  25.     <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
    26. 

  26.   </ul>
    27. 

  27. </div>
    28. 

  28. <div class="tabs">
    29. 

  29.   <ul>
    30. 

  30.     <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    31. 

  31.     <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    32. 

  32.     <li class="current"><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    33. 

  33.     <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
    34. 

  34.   </ul>
    35. 

  35. </div>
    36. 

  36. <h1>GTL - Graph Template Library Graphical Class Hierarchy</h1><a href="hierarchy.html">Go to the textual class hierarchy</a>
    37. 

  37. <p>
    38. 

  38. <table border="0" cellspacing="10" cellpadding="0">
    39. 

  39. <tr><td><img src="a00210.gif" border="0" alt="" usemap="#a00211_map">
    40. 

  40. <map name="a00211_map">
    41. 

  41. <area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="5,293,83,317"><area shape="rect" href="a00002.html" title="Bellman Ford algorithm." alt="" coords="147,5,245,29"><area shape="rect" href="a00003.html" title="Breadth&#45;First&#45;Search (BFS) algorithm." alt="" coords="176,53,216,77"><area shape="rect" href="a00005.html" title="Dijkstra&#39;s Algorithm for computing a shortest path from a single source to a..." alt="" coords="151,101,241,125"><area shape="rect" href="a00008.html" title="Depth&#45;First&#45;Search (DFS) algorithm." alt="" coords="176,149,216,173"><area shape="rect" href="a00009.html" title="Dijkstra&#39;s Algorithm for computing single source shortest path." alt="" coords="164,197,228,221"><area shape="rect" href="a00012.html" title="Heuristic graph bi&#45;partitioning algorithm (Fiduccia&#45;Mattheyses)." alt="" coords="149,245,243,269"><area shape="rect" href="a00015.html" title="Maximum flow algorithm (Edmonds&#45;Karp)." alt="" coords="152,293,240,317"><area shape="rect" href="a00016.html" title="Maximum flow algorithm (Malhotra, Kumar, Maheshwari)." alt="" coords="149,341,243,365"><area shape="rect" href="a00017.html" title="Maximum flow algorithm with shortest augmenting paths." alt="" coords="147,389,245,413"><area shape="rect" href="a00018.html" title="Kruskal&#39;s algorithm for finding minimal spanning tree of a graph." alt="" coords="159,437,233,461"><area shape="rect" href="a00023.html" title="Tests if a graph can be drawn on a plane without any edge crossings." alt="" coords="160,485,232,509"><area shape="rect" href="a00025.html" title="Heuristic graph bi&#45;partitioning algorithm (Wei&#45;Cheng)." alt="" coords="132,533,260,557"><area shape="rect" href="a00026.html" title="ST&#45;number algorithm." alt="" coords="153,581,239,605"><area shape="rect" href="a00004.html" title="Biconnectivity&#45;test and low&#45;numbers." alt="" coords="309,101,413,125"><area shape="rect" href="a00007.html" title="Connected components algorithm." alt="" coords="315,149,408,173"><area shape="rect" href="a00028.html" title="Topological sorting." alt="" coords="329,197,393,221"></map></td></tr>
    42. 

  42. <tr><td><img src="a00212.gif" border="0" alt="" usemap="#a00213_map">
    43. 

  43. <map name="a00213_map">
    44. 

  44. <area shape="rect" href="a00006.html" title="Binary heap." alt="" coords="7,5,148,29"></map></td></tr>
    45. 

  45. <tr><td><img src="a00214.gif" border="0" alt="" usemap="#a00215_map">
    46. 

  46. <map name="a00215_map">
    47. 

  47. <area shape="rect" href="a00010.html" title="An edge in a graph." alt="" coords="7,5,57,29"></map></td></tr>
    48. 

  48. <tr><td><img src="a00216.gif" border="0" alt="" usemap="#a00217_map">
    49. 

  49. <map name="a00217_map">
    50. 

  50. <area shape="rect" href="a00013.html" title="Reason and position of an error in a GML file." alt="" coords="7,5,92,29"></map></td></tr>
    51. 

  51. <tr><td><img src="a00218.gif" border="0" alt="" usemap="#a00219_map">
    52. 

  52. <map name="a00219_map">
    53. 

  53. <area shape="rect" href="a00014.html" title="A directed or undirected graph." alt="" coords="5,5,61,29"></map></td></tr>
    54. 

  54. <tr><td><img src="a00220.gif" border="0" alt="" usemap="#a00221_map">
    55. 

  55. <map name="a00221_map">
    56. 

  56. <area shape="rect" href="a00019.html" title="ne_map\&lt; edge, T, graph, Alloc \&gt;" alt="" coords="5,5,221,29"><area shape="rect" href="a00011.html" title="A specialized map with edges as keys." alt="" coords="269,5,421,29"></map></td></tr>
    57. 

  57. <tr><td><img src="a00222.gif" border="0" alt="" usemap="#a00223_map">
    58. 

  58. <map name="a00223_map">
    59. 

  59. <area shape="rect" href="a00019.html" title="Baseclass for node_map and edge_map." alt="" coords="7,5,244,29"></map></td></tr>
    60. 

  60. <tr><td><img src="a00224.gif" border="0" alt="" usemap="#a00225_map">
    61. 

  61. <map name="a00225_map">
    62. 

  62. <area shape="rect" href="a00019.html" title="ne_map\&lt; node, T, graph, Alloc \&gt;" alt="" coords="5,5,221,29"><area shape="rect" href="a00021.html" title="A specialized map with nodes as keys." alt="" coords="269,5,421,29"></map></td></tr>
    63. 

  63. <tr><td><img src="a00226.gif" border="0" alt="" usemap="#a00227_map">
    64. 

  64. <map name="a00227_map">
    65. 

  65. <area shape="rect" href="a00020.html" title="A node in a graph." alt="" coords="7,5,57,29"></map></td></tr>
    66. 

  66. <tr><td><img src="a00228.gif" border="0" alt="" usemap="#a00229_map">
    67. 

  67. <map name="a00229_map">
    68. 

  68. <area shape="rect" href="a00022.html" title="Ordered adjacency lists as a result of planarity testing." alt="" coords="5,5,139,29"></map></td></tr>
    69. 

  69. <tr><td><img src="a00230.gif" border="0" alt="" usemap="#a00231_map">
    70. 

  70. <map name="a00231_map">
    71. 

  71. <area shape="rect" href="a00024.html" title="PQ&#45;Trees." alt="" coords="5,5,72,29"></map></td></tr>
    72. 

  72. <tr><td><img src="a00232.gif" border="0" alt="" usemap="#a00233_map">
    73. 

  73. <map name="a00233_map">
    74. 

  74. <area shape="rect" href="a00027.html" title="List which can be reversed in ." alt="" coords="7,5,100,29"></map></td></tr>
    75. 

  75. </table>
    76. 

  76.     <p class="links">
    77. 

  77.       <a href="http://www.uni-passau.de/">University of Passau</a>
    78. 

  78.       &nbsp;-&nbsp;
    79. 

  79.       <a href="http://www.fmi.uni-passau.de/">FMI</a>
    80. 

  80.       &nbsp;-&nbsp;
    81. 

  81.       <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
    82. 

  82. 	Computer Science</a>
    83. 

  83.     </p>
    84. 

  84.   <div class="copyright">
    85. 

  85.       Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
    86. 

  86.   </div>
    87. 

  87. </body>
    88. 

  88. </html>
    89. 

  89.