COIN-OR::LEMON - Graph Library

Changeset 32:ef12f83752f6 in lemon-tutorial


Ignore:
Timestamp:
02/15/10 01:51:58 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Happy New Year + unify files

Files:
10 edited

Legend:

Unmodified
Added
Removed
  • adaptors.dox

    r29 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    119119maps of the original graph can be used in connection with the adaptor,
    120120since the node and arc types of the adaptors convert to the original
    121 item types. 
     121item types.
    122122
    123123\code
     
    132132instance, \ref SplitNodes, which can be used for splitting each node in
    133133a directed graph and \ref ResidualDigraph for modeling the residual
    134 network for flow and matching problems. 
     134network for flow and matching problems.
    135135
    136136Therefore, in cases when rather complex algorithms have to be used
  • basics.dox

    r28 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    125125\note Contrary to the iterators in the C++ Standard Template Library (STL),
    126126LEMON iterators are convertible to the corresponding
    127 item types without having to use \c %operator*(). This is not confusing, since the
    128 program context always indicates whether we refer to the iterator or to the graph
    129 item (they do not have conflicting functionalities).
     127item types without having to use \c %operator*(). This is not confusing,
     128since the program context always indicates whether we refer to the iterator
     129or to the graph item (they do not have conflicting functionalities).
    130130
    131131The graph items are also ordered by the 'less than' operator (with respect to
     
    155155
    156156Finally, you can also list the arcs starting from or arriving at a
    157 certain node with 
     157certain node with
    158158\ref concepts::Digraph::OutArcIt "ListDigraph::OutArcIt"
    159159and
  • getting_started.dox

    r26 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
  • graphs.dox

    r28 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    3939In LEMON, there are various graph types, which are rather different, but
    4040they all conform to the corresponding \ref graph_concepts "graph concept",
    41 which defines the common part of the graph interfaces. 
     41which defines the common part of the graph interfaces.
    4242The \ref concepts::Digraph "Digraph concept" describes the common interface
    4343of directed graphs (without any sensible implementation), while
     
    5151along with some useful basic functions for obtaining the identifiers of
    5252the items, the end nodes of the arcs (or edges) and their iterators,
    53 etc. 
     53etc.
    5454An actual graph implementation may have various additional functionalities
    5555according to its purpose.
     
    6767significantly more efficient (both in terms of space and time), but it
    6868provides less functionality. For example, nodes and arcs cannot be
    69 removed from it. 
     69removed from it.
    7070
    7171\ref FullDigraph is an efficient implementation of a directed full graph.
     
    8282
    8383The \ref concepts::Graph "undirected graphs" also fulfill the concept of
    84 \ref concepts::Digraph "directed graphs", in such a way that each 
     84\ref concepts::Digraph "directed graphs", in such a way that each
    8585undirected \e edge of a graph can also be regarded as two oppositely
    8686directed \e arcs. As a result, all directed graph algorithms automatically
     
    9999\code
    100100  ListGraph g;
    101  
     101
    102102  ListGraph::Node a = g.addNode();
    103103  ListGraph::Node b = g.addNode();
     
    134134  std::cout << "Edge " << g.id(e) << " connects node "
    135135    << g.id(g.u(e)) << " and node " << g.id(g.v(e)) << std::endl;
    136  
     136
    137137  std::cout << "Arc " << g.id(a2) << " goes from node "
    138138    << g.id(g.source(a2)) << " to node " << g.id(g.target(a2)) << std::endl;
     
    184184  std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl;
    185185\endcode
    186  
     186
    187187[SEC]sec_special_graphs[SEC] Special Graph Structures
    188188
  • intro.dox

    r26 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    2626efficient implementations of common data structures and algorithms with
    2727focus on combinatorial optimization tasks connected mainly with graphs
    28 and networks. 
     28and networks.
    2929
    3030<b>LEMON is an <a class="el" href="http://opensource.org/">open&nbsp;source</a>
  • lgf.dox

    r31 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
  • license.dox

    r26 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
  • lp.dox

    r30 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
  • mainpage.dox

    r26 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
  • tools.dox

    r31 r32  
    33 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    5  * Copyright (C) 2003-2009
     5 * Copyright (C) 2003-2010
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
     
    4646of LEMON's approach to implement named parameters. Later it
    4747has been evolved into a versatile tool featuring above 35 named
    48 parameters. The following code demonstrates its typical use. 
     48parameters. The following code demonstrates its typical use.
    4949
    5050\code
Note: See TracChangeset for help on using the changeset viewer.