/* -*- mode: C++; indent-tabs-mode: nil; -*-

  *

  * This file is a part of LEMON, a generic C++ optimization library.

  *

  * Copyright (C) 2003-2010

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * precise terms see the accompanying LICENSE file.

  *

  * This software is provided "AS IS" with no warranty of any kind,

  * express or implied, and with no claim as to its suitability for any

  * purpose.

  *

  */

 ///\file

 ///\brief Simple "Hello World!" program for LEMON.

 ///

 /// Simple "Hello World!" program for LEMON.

 ///

 /// \include hello_lemon.cc

 #include <iostream>

 #include <lemon/list_graph.h>

 using namespace lemon;

 using namespace std;

 int main()

 {

   ListDigraph g;

   ListDigraph::Node u = g.addNode();

   ListDigraph::Node v = g.addNode();

   ListDigraph::Arc  a = g.addArc(u, v);

   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;

 }