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@36: * Copyright (C) 2003-2010 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 kpeter@5: #include kpeter@5: kpeter@36: using namespace lemon; kpeter@36: using namespace std; kpeter@36: kpeter@5: int main() kpeter@5: { kpeter@36: ListDigraph g; kpeter@5: kpeter@36: ListDigraph::Node u = g.addNode(); kpeter@36: ListDigraph::Node v = g.addNode(); kpeter@36: ListDigraph::Arc a = g.addArc(u, v); kpeter@5: kpeter@36: cout << "Hello World! This is LEMON library here." << endl; kpeter@36: cout << "We have a directed graph with " << countNodes(g) << " nodes " kpeter@36: << "and " << countArcs(g) << " arc." << endl; kpeter@5: kpeter@5: return 0; kpeter@5: }