kpeter@5: /* -*- mode: C++; indent-tabs-mode: nil; -*-
kpeter@5:  *
kpeter@5:  * This file is a part of LEMON, a generic C++ optimization library.
kpeter@5:  *
kpeter@20:  * Copyright (C) 2003-2009
kpeter@5:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
kpeter@5:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
kpeter@5:  *
kpeter@5:  * Permission to use, modify and distribute this software is granted
kpeter@5:  * provided that this copyright notice appears in all copies. For
kpeter@5:  * precise terms see the accompanying LICENSE file.
kpeter@5:  *
kpeter@5:  * This software is provided "AS IS" with no warranty of any kind,
kpeter@5:  * express or implied, and with no claim as to its suitability for any
kpeter@5:  * purpose.
kpeter@5:  *
kpeter@5:  */
kpeter@5: 
kpeter@5: ///\file
kpeter@16: ///\brief Simple "Hello World!" program for LEMON.
kpeter@5: ///
kpeter@16: /// Simple "Hello World!" program for LEMON.
kpeter@5: /// \include hello_lemon.cc
kpeter@5: 
kpeter@5: #include <iostream>
kpeter@5: #include <lemon/list_graph.h>
kpeter@5: 
kpeter@5: int main()
kpeter@5: {
kpeter@16:   typedef lemon::ListDigraph Graph;
kpeter@16:   Graph g;
kpeter@5: 
kpeter@16:   Graph::Node u = g.addNode();
kpeter@16:   Graph::Node v = g.addNode();
kpeter@16:   Graph::Arc  e = g.addArc(u, v);
kpeter@5: 
kpeter@16:   std::cout << "Hello World! This is LEMON library here." << std::endl;
kpeter@16:   std::cout << "We have a directed graph with "
kpeter@16:             << countNodes(g) << " nodes and "
kpeter@16:             << countArcs(g) << " arc." << std::endl;
kpeter@5: 
kpeter@5:   return 0;
kpeter@5: }