COIN-OR::LEMON - Graph Library

Changeset 1526:8c14aa8f27a2 in lemon-0.x for doc


Ignore:
Timestamp:
06/30/05 18:13:30 (14 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2012
Message:

Mainly doc review.

Location:
doc
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • doc/graph_io.dox

    r1522 r1526  
    9494
    9595The \c GraphWriter class provides the graph output. To write a graph
    96 you should first give writing commands for the writer. You can declare
     96you should first give writing commands to the writer. You can declare
    9797write command as \c NodeMap or \c EdgeMap writing and labeled Node and
    9898Edge writing.
     
    249249
    250250The global functionality of the reader class can be changed by giving a
    251 special template parameter for the GraphReader class. By default, the
     251special template parameter to the GraphReader class. By default, the
    252252template parameter is \c DefaultReaderTraits. A reader traits class
    253253should provide an inner template class Reader for each type, and an
  • doc/quicktour.dox

    r1522 r1526  
    4545will suppose them later as well. 
    4646
    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
     51See the whole program in file \ref hello_lemon.cc in \c demo subdir of
     52LEMON package.
     53
     54    If you want to read more on the LEMON graph structures and
     55concepts, 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
     59DIMACS file formats on the web).
    6960
    7061\code
     
    7465\endcode
    7566
    76 One can also store network (graph+capacity on the edges) instances and other
    77 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,
     67One can also store network (graph+capacity on the edges) instances and
     68other things (minimum cost flow instances etc.) in DIMACS format and
     69use 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
     71the details about the output routines into files of the DIMACS format.
     72
     73<li>DIMACS formats could not give us the flexibility we needed,
    8374so we worked out our own file format. Instead of any explanation let us give a
    8475short example file in this format: read the detailed description of the LEMON
     
    240231
    241232So far we have an
    242 interface for the commercial LP solver software \b CLPLEX (developed by ILOG)
     233interface for the commercial LP solver software \b CPLEX (developed by ILOG)
    243234and for the open source solver \b GLPK (a shorthand for Gnu Linear Programming
    244235Toolkit).
Note: See TracChangeset for help on using the changeset viewer.