Changeset 32:ef12f83752f6 in lemontutorial
 Timestamp:
 02/15/10 01:51:58 (13 years ago)
 Branch:
 default
 Phase:
 public
 Files:

 10 edited
Legend:
 Unmodified
 Added
 Removed

adaptors.dox
r29 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 119 119 maps of the original graph can be used in connection with the adaptor, 120 120 since the node and arc types of the adaptors convert to the original 121 item types. 121 item types. 122 122 123 123 \code … … 132 132 instance, \ref SplitNodes, which can be used for splitting each node in 133 133 a directed graph and \ref ResidualDigraph for modeling the residual 134 network for flow and matching problems. 134 network for flow and matching problems. 135 135 136 136 Therefore, in cases when rather complex algorithms have to be used 
basics.dox
r28 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 125 125 \note Contrary to the iterators in the C++ Standard Template Library (STL), 126 126 LEMON iterators are convertible to the corresponding 127 item types without having to use \c %operator*(). This is not confusing, since the128 program context always indicates whether we refer to the iterator or to the graph 129 item (they do not have conflicting functionalities).127 item types without having to use \c %operator*(). This is not confusing, 128 since the program context always indicates whether we refer to the iterator 129 or to the graph item (they do not have conflicting functionalities). 130 130 131 131 The graph items are also ordered by the 'less than' operator (with respect to … … 155 155 156 156 Finally, you can also list the arcs starting from or arriving at a 157 certain node with 157 certain node with 158 158 \ref concepts::Digraph::OutArcIt "ListDigraph::OutArcIt" 159 159 and 
getting_started.dox
r26 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). 
graphs.dox
r28 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 39 39 In LEMON, there are various graph types, which are rather different, but 40 40 they all conform to the corresponding \ref graph_concepts "graph concept", 41 which defines the common part of the graph interfaces. 41 which defines the common part of the graph interfaces. 42 42 The \ref concepts::Digraph "Digraph concept" describes the common interface 43 43 of directed graphs (without any sensible implementation), while … … 51 51 along with some useful basic functions for obtaining the identifiers of 52 52 the items, the end nodes of the arcs (or edges) and their iterators, 53 etc. 53 etc. 54 54 An actual graph implementation may have various additional functionalities 55 55 according to its purpose. … … 67 67 significantly more efficient (both in terms of space and time), but it 68 68 provides less functionality. For example, nodes and arcs cannot be 69 removed from it. 69 removed from it. 70 70 71 71 \ref FullDigraph is an efficient implementation of a directed full graph. … … 82 82 83 83 The \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 85 85 undirected \e edge of a graph can also be regarded as two oppositely 86 86 directed \e arcs. As a result, all directed graph algorithms automatically … … 99 99 \code 100 100 ListGraph g; 101 101 102 102 ListGraph::Node a = g.addNode(); 103 103 ListGraph::Node b = g.addNode(); … … 134 134 std::cout << "Edge " << g.id(e) << " connects node " 135 135 << g.id(g.u(e)) << " and node " << g.id(g.v(e)) << std::endl; 136 136 137 137 std::cout << "Arc " << g.id(a2) << " goes from node " 138 138 << g.id(g.source(a2)) << " to node " << g.id(g.target(a2)) << std::endl; … … 184 184 std::cout << arc_cost[a1] << ", " << arc_cost[a2] << std::endl; 185 185 \endcode 186 186 187 187 [SEC]sec_special_graphs[SEC] Special Graph Structures 188 188 
intro.dox
r26 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 26 26 efficient implementations of common data structures and algorithms with 27 27 focus on combinatorial optimization tasks connected mainly with graphs 28 and networks. 28 and networks. 29 29 30 30 <b>LEMON is an <a class="el" href="http://opensource.org/">open source</a> 
lgf.dox
r31 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 085 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). 
license.dox
r26 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). 
lp.dox
r30 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). 
mainpage.dox
r26 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). 
tools.dox
r31 r32 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032010 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 46 46 of LEMON's approach to implement named parameters. Later it 47 47 has been evolved into a versatile tool featuring above 35 named 48 parameters. The following code demonstrates its typical use. 48 parameters. The following code demonstrates its typical use. 49 49 50 50 \code
Note: See TracChangeset
for help on using the changeset viewer.