COIN-OR::LEMON - Graph Library

Changeset 32:ef12f83752f6 in lemon-tutorial for basics.dox


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

File:
1 edited

Legend:

Unmodified
Added
Removed
  • 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
Note: See TracChangeset for help on using the changeset viewer.