Changeset 193:65cba1032f90 in lemon-main

Timestamp:

07/06/08 08:49:03 (17 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

194:74cd0c58b348, 195:aa45ff44fcf3, 197:5893bacaa720

Parents:

192:7bf5f97d574f (diff), 191:abc5b9d0c67e (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

File:

• demo/lgf_demo.cc (modified) (2 diffs)

demo/lgf_demo.cc

@@ -21 +21 @@
 ///\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
 
@@ -42 +43 @@
   SmartDigraph::ArcMap<int> cap(g);
   SmartDigraph::Node s, t;
-
-  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();
+  
+  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;
+  }
 
   std::cout << "A digraph is read from 'digraph.lgf'." << std::endl;