# HG changeset patch # User Peter Kovacs # Date 2008-07-05 17:22:28 # Node ID abc5b9d0c67e684c8cfafa55f2edd218f54b82a2 # Parent 1e6af6f0843c373a0579fc699ac4a83bb4f5948a lgf_demo.cc is merged with reader_writer_demo.cc (from SVN -r3501) diff --git a/demo/lgf_demo.cc b/demo/lgf_demo.cc --- a/demo/lgf_demo.cc +++ b/demo/lgf_demo.cc @@ -20,22 +20,21 @@ ///\file ///\brief Demonstrating graph input and output /// -/// This program gives an example of how to load a directed graph from -/// an \ref lgf-format "LGF" file with the \ref lemon::DigraphReader -/// "DigraphReader" class. +/// This program gives an example of how to read and write a digraph +/// and additional maps from/to a stream or a file using the +/// \ref lgf-format "LGF" format. /// /// The \c "digraph.lgf" file: /// \include digraph.lgf /// -/// And the program which reads it: +/// And the program which reads it and prints the digraph to the +/// standard output: /// \include lgf_demo.cc #include #include #include #include -#include - using namespace lemon; @@ -43,14 +42,19 @@ SmartDigraph g; SmartDigraph::ArcMap cap(g); SmartDigraph::Node s, t; + + try { + digraphReader("digraph.lgf", g). // read the directed graph into g + arcMap("capacity", cap). // read the 'capacity' arc map into cap + node("source", s). // read 'source' node to s + node("target", t). // read 'target' node to t + run(); + } catch (DataFormatError& error) { // check if there was any error + std::cerr << "Error: " << error.what() << std::endl; + return -1; + } - digraphReader("digraph.lgf", g). // read the directeg graph into g - arcMap("capacity", cap). // read the 'capacity' arc map into cap - node("source", s). // read 'source' node to s - node("target", t). // read 'target' node to t - run(); - - std::cout << "Digraph read from 'digraph.lgf'" << std::endl; + std::cout << "A digraph is read from 'digraph.lgf'." << std::endl; std::cout << "Number of nodes: " << countNodes(g) << std::endl; std::cout << "Number of arcs: " << countArcs(g) << std::endl;