Changeset 1526:8c14aa8f27a2 in lemon-0.x for doc
- Timestamp:
- 06/30/05 18:13:30 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2012
- Location:
- doc
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/graph_io.dox
r1522 r1526 94 94 95 95 The \c GraphWriter class provides the graph output. To write a graph 96 you should first give writing commands forthe writer. You can declare96 you should first give writing commands to the writer. You can declare 97 97 write command as \c NodeMap or \c EdgeMap writing and labeled Node and 98 98 Edge writing. … … 249 249 250 250 The global functionality of the reader class can be changed by giving a 251 special template parameter forthe GraphReader class. By default, the251 special template parameter to the GraphReader class. By default, the 252 252 template parameter is \c DefaultReaderTraits. A reader traits class 253 253 should provide an inner template class Reader for each type, and an -
doc/quicktour.dox
r1522 r1526 45 45 will suppose them later as well. 46 46 47 \code 48 49 typedef ListGraph Graph; 50 typedef Graph::NodeIt NodeIt; 51 52 Graph g; 53 54 for (int i = 0; i < 3; i++) 55 g.addNode(); 56 57 for (NodeIt i(g); i!=INVALID; ++i) 58 for (NodeIt j(g); j!=INVALID; ++j) 59 if (i != j) g.addEdge(i, j); 60 61 \endcode 62 63 See the whole program in file \ref helloworld.cc. 64 65 If you want to read more on the LEMON graph structures and concepts, read the page about \ref graphs "graphs". 66 67 <li> The following code shows how to read a graph from a stream (e.g. a file) 68 in the DIMACS file format (find the documentation of the DIMACS file formats on the web). 47 \dontinclude hello_lemon.cc 48 \skip ListGraph 49 \until addEdge 50 51 See the whole program in file \ref hello_lemon.cc in \c demo subdir of 52 LEMON package. 53 54 If you want to read more on the LEMON graph structures and 55 concepts, read the page about \ref graphs "graphs". 56 57 <li> The following code shows how to read a graph from a stream 58 (e.g. a file) in the DIMACS file format (find the documentation of the 59 DIMACS file formats on the web). 69 60 70 61 \code … … 74 65 \endcode 75 66 76 One can also store network (graph+capacity on the edges) instances and other77 things (minimum cost flow instances etc.) in DIMACS format and use these in LEMON: to see the details read the 78 documentation of the \ref dimacs.h "Dimacs file format reader". There you will 79 also find the details about the output routines into files of the DIMACS 80 format. 81 82 <li> We needed much greater flexibility than the DIMACS formats could give us,67 One can also store network (graph+capacity on the edges) instances and 68 other things (minimum cost flow instances etc.) in DIMACS format and 69 use these in LEMON: to see the details read the documentation of the 70 \ref dimacs.h "Dimacs file format reader". There you will also find 71 the details about the output routines into files of the DIMACS format. 72 73 <li>DIMACS formats could not give us the flexibility we needed, 83 74 so we worked out our own file format. Instead of any explanation let us give a 84 75 short example file in this format: read the detailed description of the LEMON … … 240 231 241 232 So far we have an 242 interface for the commercial LP solver software \b C LPLEX (developed by ILOG)233 interface for the commercial LP solver software \b CPLEX (developed by ILOG) 243 234 and for the open source solver \b GLPK (a shorthand for Gnu Linear Programming 244 235 Toolkit).
Note: See TracChangeset
for help on using the changeset viewer.