1 \input texinfo   @c -*-texinfo-*-
 
     2 @comment $Id: etikol.texi,v 1.5 2004/02/10 13:29:15 alpar Exp $
 
     3 @comment %**start of header
 
     4 @setfilename etikol.info
 
     6 @settitle GNU ETIK-OL Optimization Library @value{VERSION}
 
    10 @c @macro mref { nn, txt }
 
    15 @macro mref { nn, txt }
 
    28 @c Whereas this text will only appear in plain text.
 
    31 @c And this will only appear in XML output.
 
    36 @comment %**end of header
 
    39 This manual is for GNU ETIL-OL Optimization Library
 
    40 (version @value{VERSION}, @value{UPDATED}).
 
    42 Copyright @copyright{} 2003 ETIK.
 
    45 Permission is granted to copy, distribute and/or modify this document
 
    46 under the terms of the GNU Free Documentation License, Version 1.1 or
 
    47 any later version published by the Free Software Foundation; with no
 
    48 Invariant Sections, with the Front-Cover Texts being ``A GNU Manual,''
 
    49 and with the Back-Cover Texts as in (a) below.  A copy of the
 
    50 license is included in the section entitled ``GNU Free Documentation
 
    53 (a) The FSF's Back-Cover Text is: ``You have freedom to copy and modify
 
    54 this GNU Manual, like GNU software.  Copies published by the Free
 
    55 Software Foundation raise funds for GNU development.''
 
    59 @dircategory Texinfo documentation system
 
    61 * ETIK-OL: ETIK-OL Optimization Library.
 
    65 @title GNU  ETIL-OL Optimization Library
 
    66 @subtitle for version @value{VERSION}, @value{UPDATED}
 
    69 @vskip 0pt plus 1filll
 
    77 @top GNU ETIK-OL Library
 
    84 * Copying This Manual::
 
    90 @chapter Basic Concepts
 
    93 * The Full Feature Graph Class::
 
    97 @include flf-graph.texi
 
    99 @c @node A Full Feature Graph
 
   100 @c @section A Full Feature Graph
 
   101 @c @cindex Full Feature Graph
 
   103 @node The BFS algorithm
 
   104 @section The BFS algorithm
 
   105 @cindex The BFS algorithm
 
   108 * Iterator style BFS class::
 
   114 @node Iterator style BFS class
 
   115 @subsection Iterator style BFS class
 
   116 @cindex BFS algorithm
 
   119 Here is a code example.
 
   127   bfs_node_data<G> NodeType::*d;
 
   128   typedef typename G::EdgeIterator value_type;
 
   129   void Put(typename G::NodeIterator &i,
 
   130            const value_type &t);
 
   131   value_type Get(const typename G::NodeIterator &i) const;
 
   137 The same code with a remark.
 
   144   bfs_node_data<G> NodeType::*d;
 
   145   typedef typename G::EdgeIterator value_type;
 
   146   void Put(typename G::NodeIterator &i,
 
   147            const value_type &t);        @r{This is a long funcion declaration.}
 
   148   value_type Get(const typename G::NodeIterator &i) const;
 
   151 @comment @end quotation
 
   153 @node The BFS funcion
 
   154 @subsection The BFS funcion
 
   155 @cindex BFS algorithm
 
   159 This is the first item.
 
   162 This is the second item.
 
   166 @node Copying This Manual
 
   167 @appendix Copying This Manual
 
   170 * GNU Free Documentation License::  License for copying this manual.
 
   177 @unnumbered Concept Index
 
   180 @c @node Function Index
 
   181 @unnumbered Function Index
 
   185 @unnumbered Type Index