# Changeset 1192:b84e68af8248 in lemon

Ignore:
Timestamp:
11/25/10 22:45:29 (10 years ago)
Branch:
default
Phase:
public
Message:

LGF reader and writer for bipartite graphs (#69)

Files:
4 edited

Unmodified
Removed
• ## doc/lgf.dox

 r1069 \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 \e LGF files can also contain bipartite graphs, in this case a \c @red_nodes and a \c @blue_nodes sections describe the node set of the graph. If a map is in both of these sections, then it can be used as a regular node map. \code @red_nodes label  only_red_map   name 1      "cherry"       "John" 2      "Santa Claus"  "Jack" 3      "blood"        "Jason" @blue_nodes label  name 4      "Elisabeth" 5      "Eve" \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 values. The source and target tokens must be node labels.
• ## lemon/full_graph.h

 r1188 } using Parent::redNode; using Parent::blueNode; /// \brief Returns the red node with the given index. ///