1.1 --- a/src/work/alpar/attic/texi/etikol.texi Sun Apr 17 18:57:22 2005 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,189 +0,0 @@
1.4 -\input texinfo @c -*-texinfo-*-
1.5 -@comment $Id: etikol.texi,v 1.5 2004/02/10 13:29:15 alpar Exp $
1.6 -@comment %**start of header
1.7 -@setfilename etikol.info
1.8 -@include version.texi
1.9 -@settitle GNU ETIK-OL Optimization Library @value{VERSION}
1.10 -@syncodeindex pg cp
1.11 -
1.12 -@c @ifnottex
1.13 -@c @macro mref { nn, txt }
1.14 -@c @ref{\nn\,\txt\}
1.15 -@c @end macro
1.16 -@c @end ifnottex
1.17 -@c @iftex
1.18 -@macro mref { nn, txt }
1.19 -@ifnottex
1.20 -@ref{\nn\,\txt\}
1.21 -@end ifnottex
1.22 -@tex
1.23 -\txt\
1.24 -@end tex
1.25 -@end macro
1.26 -@c @href{\nn\}{\txt\}
1.27 -
1.28 -
1.29 -
1.30 -@c @ifplaintext
1.31 -@c Whereas this text will only appear in plain text.
1.32 -@c @end ifplaintext
1.33 -@c @ifxml
1.34 -@c And this will only appear in XML output.
1.35 -@c @end ifxm
1.36 -@c @ref{\nn\,\txt\}
1.37 -
1.38 -
1.39 -@comment %**end of header
1.40 -
1.41 -@copying
1.42 -This manual is for GNU ETIL-OL Optimization Library
1.43 -(version @value{VERSION}, @value{UPDATED}).
1.44 -
1.45 -Copyright @copyright{} 2003 ETIK.
1.46 -
1.47 -@quotation
1.48 -Permission is granted to copy, distribute and/or modify this document
1.49 -under the terms of the GNU Free Documentation License, Version 1.1 or
1.50 -any later version published by the Free Software Foundation; with no
1.51 -Invariant Sections, with the Front-Cover Texts being ``A GNU Manual,''
1.52 -and with the Back-Cover Texts as in (a) below. A copy of the
1.53 -license is included in the section entitled ``GNU Free Documentation
1.54 -License.''
1.55 -
1.56 -(a) The FSF's Back-Cover Text is: ``You have freedom to copy and modify
1.57 -this GNU Manual, like GNU software. Copies published by the Free
1.58 -Software Foundation raise funds for GNU development.''
1.59 -@end quotation
1.60 -@end copying
1.61 -
1.62 -@dircategory Texinfo documentation system
1.63 -@direntry
1.64 -* ETIK-OL: ETIK-OL Optimization Library.
1.65 -@end direntry
1.66 -
1.67 -@titlepage
1.68 -@title GNU ETIL-OL Optimization Library
1.69 -@subtitle for version @value{VERSION}, @value{UPDATED}
1.70 -@author ETIK Group
1.71 -@page
1.72 -@vskip 0pt plus 1filll
1.73 -@c @insertcopying
1.74 -@end titlepage
1.75 -
1.76 -@contents
1.77 -
1.78 -@ifnottex
1.79 -@node Top
1.80 -@top GNU ETIK-OL Library
1.81 -
1.82 -@c @insertcopying
1.83 -@end ifnottex
1.84 -
1.85 -@menu
1.86 -* Basic Concepts::
1.87 -* Copying This Manual::
1.88 -* Index::
1.89 -@end menu
1.90 -
1.91 -
1.92 -@node Basic Concepts
1.93 -@chapter Basic Concepts
1.94 -
1.95 -@menu
1.96 -* The Full Feature Graph Class::
1.97 -* The BFS algorithm::
1.98 -@end menu
1.99 -
1.100 -@include flf-graph.texi
1.101 -
1.102 -@c @node A Full Feature Graph
1.103 -@c @section A Full Feature Graph
1.104 -@c @cindex Full Feature Graph
1.105 -
1.106 -@node The BFS algorithm
1.107 -@section The BFS algorithm
1.108 -@cindex The BFS algorithm
1.109 -
1.110 -@menu
1.111 -* Iterator style BFS class::
1.112 -* The BFS funcion::
1.113 -@end menu
1.114 -
1.115 -bla2
1.116 -
1.117 -@node Iterator style BFS class
1.118 -@subsection Iterator style BFS class
1.119 -@cindex BFS algorithm
1.120 -@cindex BFS concept
1.121 -
1.122 -Here is a code example.
1.123 -
1.124 -
1.125 -@quotation
1.126 -@verbatim
1.127 -class
1.128 -{
1.129 -public:
1.130 - bfs_node_data<G> NodeType::*d;
1.131 - typedef typename G::EdgeIterator value_type;
1.132 - void Put(typename G::NodeIterator &i,
1.133 - const value_type &t);
1.134 - value_type Get(const typename G::NodeIterator &i) const;
1.135 -} tree;
1.136 -@end verbatim
1.137 -@end quotation
1.138 -
1.139 -
1.140 -The same code with a remark.
1.141 -
1.142 -@comment @quotation
1.143 -@example
1.144 -class
1.145 -@{
1.146 -public:
1.147 - bfs_node_data<G> NodeType::*d;
1.148 - typedef typename G::EdgeIterator value_type;
1.149 - void Put(typename G::NodeIterator &i,
1.150 - const value_type &t); @r{This is a long funcion declaration.}
1.151 - value_type Get(const typename G::NodeIterator &i) const;
1.152 -@} tree;
1.153 -@end example
1.154 -@comment @end quotation
1.155 -
1.156 -@node The BFS funcion
1.157 -@subsection The BFS funcion
1.158 -@cindex BFS algorithm
1.159 -
1.160 -@enumerate
1.161 -@item
1.162 -This is the first item.
1.163 -
1.164 -@item
1.165 -This is the second item.
1.166 -@end enumerate
1.167 -
1.168 -
1.169 -@node Copying This Manual
1.170 -@appendix Copying This Manual
1.171 -
1.172 -@menu
1.173 -* GNU Free Documentation License:: License for copying this manual.
1.174 -@end menu
1.175 -
1.176 -@include fdl.texi
1.177 -
1.178 -
1.179 -@node Index
1.180 -@unnumbered Concept Index
1.181 -@printindex cp
1.182 -
1.183 -@c @node Function Index
1.184 -@unnumbered Function Index
1.185 -@printindex fn
1.186 -
1.187 -@c @node Type Index
1.188 -@unnumbered Type Index
1.189 -@printindex tp
1.190 -
1.191 -@bye
1.192 -