1 \input texinfo @c -*-texinfo-*-
2 @comment $Id: etikol.texi,v 1.1 2004/01/20 11:21:42 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
38 This manual is for GNU ETIL-OL Optimization Library
39 (version @value{VERSION}, @value{UPDATED}).
41 Copyright @copyright{} 2003 ETIK.
44 Permission is granted to copy, distribute and/or modify this document
45 under the terms of the GNU Free Documentation License, Version 1.1 or
46 any later version published by the Free Software Foundation; with no
47 Invariant Sections, with the Front-Cover Texts being ``A GNU Manual,''
48 and with the Back-Cover Texts as in (a) below. A copy of the
49 license is included in the section entitled ``GNU Free Documentation
52 (a) The FSF's Back-Cover Text is: ``You have freedom to copy and modify
53 this GNU Manual, like GNU software. Copies published by the Free
54 Software Foundation raise funds for GNU development.''
58 @dircategory Texinfo documentation system
60 * ETIK-OL: ETIK-OL Optimization Library.
64 @title GNU ETIL-OL Optimization Library
65 @subtitle for version @value{VERSION}, @value{UPDATED}
68 @vskip 0pt plus 1filll
76 @top GNU ETIK-OL Library
83 * Copying This Manual::
89 @chapter Basic Concepts
92 * The Full Feature Graph Class::
96 @include flf-graph.texi
98 @c @node A Full Feature Graph
99 @c @section A Full Feature Graph
100 @c @cindex Full Feature Graph
102 @node The BFS algorithm
103 @section The BFS algorithm
104 @cindex The BFS algorithm
107 * Iterator style BFS class::
113 @node Iterator style BFS class
114 @subsection Iterator style BFS class
115 @cindex BFS algorithm
118 Here is a code example.
126 bfs_node_data<G> NodeType::*d;
127 typedef typename G::EdgeIterator value_type;
128 void Put(typename G::NodeIterator &i,
129 const value_type &t);
130 value_type Get(const typename G::NodeIterator &i) const;
136 The same code with a remark.
143 bfs_node_data<G> NodeType::*d;
144 typedef typename G::EdgeIterator value_type;
145 void Put(typename G::NodeIterator &i,
146 const value_type &t); @r{This is a long funcion declaration.}
147 value_type Get(const typename G::NodeIterator &i) const;
150 @comment @end quotation
152 @node The BFS funcion
153 @subsection The BFS funcion
154 @cindex BFS algorithm
158 This is the first item.
161 This is the second item.
165 @node Copying This Manual
166 @appendix Copying This Manual
169 * GNU Free Documentation License:: License for copying this manual.
176 @unnumbered Concept Index
179 @c @node Function Index
180 @unnumbered Function Index
184 @unnumbered Type Index