# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1266688924 -3600
# Node ID 199a65b64d90c940c8e1976ffb9aa4a9a85c9931
# Parent  f7a4e802495290bd0abc0317b3fedba6cd6e4520
Simplify hello_lemon.cc with 'using namespace' commands

diff -r f7a4e8024952 -r 199a65b64d90 demo/hello_lemon.cc
--- a/demo/hello_lemon.cc	Wed Feb 17 17:42:19 2010 +0000
+++ b/demo/hello_lemon.cc	Sat Feb 20 19:02:04 2010 +0100
@@ -2,7 +2,7 @@
  *
  * This file is a part of LEMON, a generic C++ optimization library.
  *
- * Copyright (C) 2003-2009
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
  *
@@ -25,19 +25,20 @@
 #include <iostream>
 #include <lemon/list_graph.h>
 
+using namespace lemon;
+using namespace std;
+
 int main()
 {
-  typedef lemon::ListDigraph Graph;
-  Graph g;
+  ListDigraph g;
 
-  Graph::Node u = g.addNode();
-  Graph::Node v = g.addNode();
-  Graph::Arc  e = g.addArc(u, v);
+  ListDigraph::Node u = g.addNode();
+  ListDigraph::Node v = g.addNode();
+  ListDigraph::Arc  a = g.addArc(u, v);
 
-  std::cout << "Hello World! This is LEMON library here." << std::endl;
-  std::cout << "We have a directed graph with "
-            << countNodes(g) << " nodes and "
-            << countArcs(g) << " arc." << std::endl;
+  cout << "Hello World! This is LEMON library here." << endl;
+  cout << "We have a directed graph with " << countNodes(g) << " nodes "
+       << "and " << countArcs(g) << " arc." << endl;
 
   return 0;
 }