RhodeCode

  digraphReader("digraph.lgf", g). // read the directed graph into g

  std::cout << "A digraph is read from 'digraph.lgf'." << std::endl;

\brief Reading and writing \ref lgf-format "Lemon Graph Format".

This group describes methods for reading and writing \ref lgf-format "Lemon Graph Format".

maps. The first is a header line, its columns are the names of the

it again starts with a header line describing the names of the maps,

///\brief \ref lgf-format "Lemon Graph Format" reader.

  /// \brief \ref lgf-format "LGF" reader for directed graphs

  /// converting from \c std::string to the value type of the map. If it

  /// converted to the value type of the map. If the functor is not set,

  /// DigraphReader<Digraph>(std::cin, digraph).

  ///   nodeMap("coordinates", coord_map).

  ///   arcMap("capacity", cap_map).

  ///   node("source", src).

  ///   node("target", trg).

  ///   attribute("caption", caption).

  ///   run();

  /// application of these functions is multipass reading, which is

  /// important if two \c \@arcs sections must be read from the

  /// file. In this case the first phase would read the node set and one

  /// paths are given as a node map or an arc map. It is impossible to read this in

    /// \c std::string.

    /// \c std::string.

    /// map reading rule will be abandoned, and the nodes of the graph

    /// could not be read due to lack of node name resolving.

    /// Therefore \c skipArcs() function should also be used, or

    /// \c useNodes() should be used to specify the label of the nodes.

    /// map reading rule will be abandoned, and the arcs of the graph

  /// \brief Return a \ref DigraphReader class

  /// 

  /// This function just returns a \ref DigraphReader class.

  /// \brief Return a \ref DigraphReader class

  /// 

  /// This function just returns a \ref DigraphReader class.

  /// \brief Return a \ref DigraphReader class

  /// 

  /// This function just returns a \ref DigraphReader class.

  /// \brief \ref lgf-format "LGF" reader for undirected graphs

  ///

  /// It can be used almost the same way as \c DigraphReader.

  /// The only difference is that this class can handle edges and

  /// edge maps as well as arcs and arc maps.

    /// Construct an undirected graph reader, which reads from the given

    /// Construct an undirected graph reader, which reads from the given

    /// Construct an undirected graph reader, which reads from the given

    /// Set \c \@nodes section to be read.

    /// Set \c \@edges section to be read.

    /// Set \c \@attributes section to be read.

    /// \c std::string.

    /// \c std::string.

    /// \brief Skip the reading of node section

    /// map reading rule will be abandoned, and the nodes of the graph

    /// could not be read due to lack of node name resolving.

    /// Therefore \c skipEdges() function should also be used, or

    /// \c useNodes() should be used to specify the label of the nodes.

    /// \brief Skip the reading of edge section

    /// map reading rule will be abandoned, and the edges of the graph

  /// \brief Return a \ref GraphReader class

  /// 

  /// This function just returns a \ref GraphReader class.

  /// \brief Return a \ref GraphReader class

  /// 

  /// This function just returns a \ref GraphReader class.

  /// \brief Return a \ref GraphReader class

  /// 

  /// This function just returns a \ref GraphReader class.

  /// \ingroup lemon_io

  ///

  /// In the \ref lgf-format "LGF" file extra sections can be placed, 

  /// which contain any data in arbitrary format. Such sections can be

  /// read with this class. A reading rule can be added to the class 

  /// with two different functions. With the \c sectionLines() function a

  /// functor can process the section line-by-line, while with the \c

    /// The functor is implemented as a struct:

      LEMON_ASSERT(!type.empty(), "Type is empty.");

    /// a functor, which takes an \c std::istream& and an \c int&

      LEMON_ASSERT(!type.empty(), "Type is empty.");

    /// This function starts the batch processing.

  /// \brief Return a \ref SectionReader class

  /// 

  /// This function just returns a \ref SectionReader class.

  /// \brief Return a \ref SectionReader class

  /// 

  /// This function just returns a \ref SectionReader class.

  /// \brief Return a \ref SectionReader class

  /// 

  /// This function just returns a \ref SectionReader class.

  ///\code 

  /// LgfContents contents("graph.lgf"); 

  /// // Does it contain any node section and arc section?

  ///   std::cerr << "Failure, cannot find graph." << std::endl;

  /// std::cout << "The name of the default node section: " 

  /// std::cout << "The number of the arc maps: " 

  /// std::cout << "The name of second arc map: " 

    /// \brief Returns the node section name at the given position. 

    /// Returns the node section name at the given position. 

    /// \brief Returns the arc/edge section name at the given position. 

    /// Returns the arc/edge section name at the given position. 

    /// \brief Returns the attribute section name at the given position. 

    /// Returns the attribute section name at the given position. 

    /// \brief Starts the reading

    /// This function starts the reading.

///\brief \ref lgf-format "Lemon Graph Format" writer.

  /// \brief \ref lgf-format "LGF" writer for directed graphs

  /// converting from the value type of the map to \c std::string. If it

  /// is set, it will determine how the value type of the map is written to

  /// DigraphWriter<Digraph>(std::cout, digraph).

  ///   nodeMap("coordinates", coord_map).

  ///   nodeMap("size", size).

  ///   nodeMap("title", title).

  ///   arcMap("capacity", cap_map).

  ///   node("source", src).

  ///   node("target", trg).

  ///   attribute("caption", caption).

  ///   run();

    /// \brief Node map writing rule

    /// Add a node map writing rule to the writer.

    /// \name Section captions

    /// \brief Add an additional caption to the \c \@nodes section

    /// Add an additional caption to the \c \@nodes section.

    /// \brief Add an additional caption to the \c \@arcs section

    /// Add an additional caption to the \c \@arcs section.

    /// \brief Add an additional caption to the \c \@attributes section

    /// Add an additional caption to the \c \@attributes section.

    /// The \c \@nodes section will not be written to the stream.

    /// The \c \@arcs section will not be written to the stream.

    /// This function starts the batch processing.

    /// \brief Give back the stream of the writer

    /// Give back the stream of the writer.

  /// \brief Return a \ref DigraphWriter class

  /// 

  /// This function just returns a \ref DigraphWriter class.

  /// \brief Return a \ref DigraphWriter class

  /// 

  /// This function just returns a \ref DigraphWriter class.

  /// \brief Return a \ref DigraphWriter class

  /// 

  /// This function just returns a \ref DigraphWriter class.

  /// \brief \ref lgf-format "LGF" writer for directed graphs

  ///

  /// It can be used almost the same way as \c DigraphWriter.

  /// The only difference is that this class can handle edges and

  /// edge maps as well as arcs and arc maps.

    /// \brief Node map writing rule

    /// Add a node map writing rule to the writer.

    /// \name Section captions

    /// \brief Add an additional caption to the \c \@nodes section

    /// Add an additional caption to the \c \@nodes section.

    /// \brief Add an additional caption to the \c \@arcs section

    /// Add an additional caption to the \c \@arcs section.

    /// \brief Add an additional caption to the \c \@attributes section

    /// Add an additional caption to the \c \@attributes section.

    /// The \c \@nodes section will not be written to the stream.

    /// The \c \@edges section will not be written to the stream.

    /// This function starts the batch processing.

    /// \brief Give back the stream of the writer

    /// Give back the stream of the writer

  /// \brief Return a \ref GraphWriter class

  /// 

  /// This function just returns a \ref GraphWriter class.

  /// \brief Return a \ref GraphWriter class

  /// 

  /// This function just returns a \ref GraphWriter class.

  /// \brief Return a \ref GraphWriter class

  /// 

  /// This function just returns a \ref GraphWriter class.