COIN-OR::LEMON - Graph Library

source: lemon-tutorial/demo/hello_lemon.cc @ 16:ed4c8506e151

Last change on this file since 16:ed4c8506e151 was 16:ed4c8506e151, checked in by Peter Kovacs <kpeter@…>, 11 years ago

Simplify the first example code + fix toc

File size: 1.2 KB
RevLine 
[5]1/* -*- mode: C++; indent-tabs-mode: nil; -*-
2 *
3 * This file is a part of LEMON, a generic C++ optimization library.
4 *
5 * Copyright (C) 2003-2008
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
8 *
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
12 *
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
15 * purpose.
16 *
17 */
18
19///\file
[16]20///\brief Simple "Hello World!" program for LEMON.
[5]21///
[16]22/// Simple "Hello World!" program for LEMON.
[5]23/// \include hello_lemon.cc
24
25#include <iostream>
26#include <lemon/list_graph.h>
27
28int main()
29{
[16]30  typedef lemon::ListDigraph Graph;
31  Graph g;
[5]32
[16]33  Graph::Node u = g.addNode();
34  Graph::Node v = g.addNode();
35  Graph::Arc  e = g.addArc(u, v);
[5]36
[16]37  std::cout << "Hello World! This is LEMON library here." << std::endl;
38  std::cout << "We have a directed graph with "
39            << countNodes(g) << " nodes and "
40            << countArcs(g) << " arc." << std::endl;
[5]41
42  return 0;
43}
Note: See TracBrowser for help on using the repository browser.