Changeset 923:c8c8801db0a4 in lemon-1.2

Ignore:
Timestamp:
08/04/11 21:33:17 (8 years ago)
Branch:
1.2
Parents:
921:b522385b2a0d (diff), 922:54464584b157 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Phase:
public
Message:

Merge #382 to branch 1.2

Files:
8 edited

Unmodified
Removed
• doc/lgf.dox

 r440 \endcode The \c \@arcs section is very similar to the \c \@nodes section, it again starts with a header line describing the names of the maps, but the \c "label" map is not obligatory here. The following lines describe the arcs. The first two tokens of each line are the source and the target node of the arc, respectively, then come the map The \c \@arcs section is very similar to the \c \@nodes section, it again starts with a header line describing the names of the maps, but the \c "label" map is not obligatory here. The following lines describe the arcs. The first two tokens of each line are the source and the target node of the arc, respectively, then come the map values. The source and target tokens must be node labels. \endcode If there is no map in the \c \@arcs section at all, then it must be indicated by a sole '-' sign in the first line. \code @arcs - 1   2 1   3 2   3 \endcode The \c \@edges is just a synonym of \c \@arcs. The \@arcs section can also store the edge set of an undirected graph. In such case there is a conventional method for store arc maps in the file, if two columns has the same caption with \c '+' and \c '-' prefix, then these columns have the same caption with \c '+' and \c '-' prefix, then these columns can be regarded as the values of an arc map.
• doc/lgf.dox

 r922 * This file is a part of LEMON, a generic C++ optimization library. * * Copyright (C) 2003-2008 * Copyright (C) 2003-2009 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport * (Egervary Research Group on Combinatorial Optimization, EGRES).