1.1 --- a/doc/lgf.dox Mon Jul 16 16:21:40 2018 +0200
1.2 +++ b/doc/lgf.dox Wed Oct 17 19:14:07 2018 +0200
1.3 @@ -2,7 +2,7 @@
1.4 *
1.5 * This file is a part of LEMON, a generic C++ optimization library.
1.6 *
1.7 - * Copyright (C) 2003-2009
1.8 + * Copyright (C) 2003-2013
1.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.11 *
1.12 @@ -63,11 +63,28 @@
1.13 3 (40,10) 10 "Third node"
1.14 \endcode
1.15
1.16 -The \c \@arcs section is very similar to the \c \@nodes section, it
1.17 -again starts with a header line describing the names of the maps, but
1.18 -the \c "label" map is not obligatory here. The following lines
1.19 -describe the arcs. The first two tokens of each line are the source
1.20 -and the target node of the arc, respectively, then come the map
1.21 +The \e LGF files can also contain bipartite graphs, in this case a
1.22 +\c \@red_nodes and a \c \@blue_nodes sections describe the node set of the
1.23 +graph. If a map is in both of these sections, then it can be used as a
1.24 +regular node map.
1.25 +
1.26 +\code
1.27 + @red_nodes
1.28 + label only_red_map name
1.29 + 1 "cherry" "John"
1.30 + 2 "Santa Claus" "Jack"
1.31 + 3 "blood" "Jason"
1.32 + @blue_nodes
1.33 + label name
1.34 + 4 "Elisabeth"
1.35 + 5 "Eve"
1.36 +\endcode
1.37 +
1.38 +The \c \@arcs section is very similar to the \c \@nodes section,
1.39 +it again starts with a header line describing the names of the maps,
1.40 +but the \c "label" map is not obligatory here. The following lines
1.41 +describe the arcs. The first two tokens of each line are
1.42 +the source and the target node of the arc, respectively, then come the map
1.43 values. The source and target tokens must be node labels.
1.44
1.45 \code