equal
deleted
inserted
replaced
146 |
146 |
147 \verbatim |
147 \verbatim |
148 --with-glpk-includedir=DIR |
148 --with-glpk-includedir=DIR |
149 \endverbatim |
149 \endverbatim |
150 The directory where the GLPK header files are located. This is only useful when |
150 The directory where the GLPK header files are located. This is only useful when |
151 the GLPK headers and libraries are not under the same prefix (which is not |
151 the GLPK headers and libraries are not under the same prefix (which is |
152 likely). |
152 unlikely). |
153 |
153 |
154 \verbatim |
154 \verbatim |
155 --with-glpk-libdir=DIR |
155 --with-glpk-libdir=DIR |
156 \endverbatim |
156 \endverbatim |
157 The directory where the GLPK libraries are located. This is only useful when |
157 The directory where the GLPK libraries are located. This is only useful when |
158 the GLPK headers and libraries are not under the same prefix (which is not |
158 the GLPK headers and libraries are not under the same prefix (which is |
159 likely). |
159 unlikely). |
160 |
160 |
161 \verbatim |
161 \verbatim |
162 --without-glpk |
162 --without-glpk |
163 \endverbatim |
163 \endverbatim |
164 Disable GLPK support. |
164 Disable GLPK support. |
234 First let us briefly explain how this program works. |
234 First let us briefly explain how this program works. |
235 |
235 |
236 ListGraph is one of LEMON's graph classes. It is based on linked lists, |
236 ListGraph is one of LEMON's graph classes. It is based on linked lists, |
237 therefore iterating throuh its edges and nodes is fast. |
237 therefore iterating throuh its edges and nodes is fast. |
238 |
238 |
239 After some convenient typedefs we create a graph and add three nodes to it. |
239 After some convenience typedefs we create a graph and add three nodes to it. |
240 Then we add edges to it to form a complete graph. |
240 Then we add edges to it to form a complete graph. |
241 |
241 |
242 Then we iterate through all nodes of the graph. We use a constructor of the |
242 Then we iterate through all nodes of the graph. We use a constructor of the |
243 node iterator to initialize it to the first node. The operator++ is used to |
243 node iterator to initialize it to the first node. The operator++ is used to |
244 step to the next node. Using operator++ on the iterator pointing to the last |
244 step to the next node. Using operator++ on the iterator pointing to the last |
248 We can also iterate through all edges of the graph very similarly. The |
248 We can also iterate through all edges of the graph very similarly. The |
249 \c target and |
249 \c target and |
250 \c source member functions can be used to access the endpoints of an edge. |
250 \c source member functions can be used to access the endpoints of an edge. |
251 |
251 |
252 If your installation of LEMON into directory \c /usr/local was |
252 If your installation of LEMON into directory \c /usr/local was |
253 successful then it is very easy to compile this program with the |
253 successful, then it is very easy to compile this program with the |
254 following command (the argument <tt>-lemon</tt> tells the compiler |
254 following command (the argument <tt>-lemon</tt> tells the compiler |
255 that we are using the installed library LEMON): |
255 that we are using the installed library LEMON): |
256 |
256 |
257 \verbatim |
257 \verbatim |
258 g++ hello_lemon.cc -o hello_lemon -lemon |
258 g++ hello_lemon.cc -o hello_lemon -lemon |