Ticket #81: port_hello_lemon_9309a3751e39.patch

demo/CMakeLists.txt

@@ -5 +5 @@
 set (DEMOS
   arg_parser_demo
   graph_to_eps_demo
+  hello_lemon
   lgf_demo)
 
 foreach (DEMO_NAME ${DEMOS})

demo/Makefile.am

@@ -7 +7 @@
 noinst_PROGRAMS += \
         demo/arg_parser_demo \
         demo/graph_to_eps_demo \
+        demo/hello_lemon \
         demo/lgf_demo
 
 endif WANT_DEMO
 
 demo_arg_parser_demo_SOURCES = demo/arg_parser_demo.cc
 demo_graph_to_eps_demo_SOURCES = demo/graph_to_eps_demo.cc
+demo_hello_lemon_SOURCES = demo/hello_lemon.cc
 demo_lgf_demo_SOURCES = demo/lgf_demo.cc

new file demo/hello_lemon.cc

@@ +1 @@
+/* -*- C++ -*-
+ *
+ * This file is a part of LEMON, a generic C++ optimization library
+ *
+ * Copyright (C) 2003-2008
+ * 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.
+ *
+ */
+
+///\ingroup demos
+///\file
+///\brief Demonstrating the very basic notions of LEMON
+///
+/// This program is intended to be a "Hello World!" program that shows
+/// the very basic notions of LEMON: \ref graphs "graphs" and 
+/// \ref maps-page "maps".
+///
+/// \include hello_lemon.cc
+
+#include <iostream>
+#include <lemon/list_graph.h>
+
+int main()
+{ 
+  // Convenient type definitions
+  typedef lemon::ListDigraph Digraph;
+  typedef Digraph::Node Node;
+  typedef Digraph::Arc Arc;
+  typedef Digraph::NodeIt NodeIt;
+  typedef Digraph::ArcIt ArcIt;
+  typedef Digraph::ArcMap<int> LengthMap;
+  using lemon::INVALID;
+
+  // Create a directed graph
+  Digraph g;
+  
+  // Add nodes to the digraph
+  Node s  = g.addNode();
+  Node v2 = g.addNode();
+  Node v3 = g.addNode();
+  Node v4 = g.addNode();
+  Node v5 = g.addNode();
+  Node t  = g.addNode();
+
+  // Add arcs to the digraph
+  Arc s_v2  = g.addArc(s, v2);
+  Arc s_v3  = g.addArc(s, v3);
+  Arc v2_v4 = g.addArc(v2, v4);
+  Arc v2_v5 = g.addArc(v2, v5);
+  Arc v3_v5 = g.addArc(v3, v5);
+  Arc v4_t  = g.addArc(v4, t);
+  Arc v5_t  = g.addArc(v5, t);
+  
+  // Create an arc map (length)
+  LengthMap length(g);
+  
+  // Set the length of each arc
+  length[s_v2]  = 10;
+  length[s_v3]  = 10;
+  length[v2_v4] = 5;
+  length[v2_v5] = 8;
+  length[v3_v5] = 5;
+  length[v4_t]  = 8;
+  length[v5_t]  = 8;
+
+  std::cout << "Hello World!" << std::endl;
+  std::cout << std::endl;
+  std::cout << "This is library LEMON here. We have a direceted graph.";
+  std::cout << std::endl << std::endl;
+
+  // Iterate through the nodes and print their IDs
+  std::cout << "Nodes:";
+  for (NodeIt n(g); n != INVALID; ++n)
+    std::cout << " " << g.id(n);
+  std::cout << std::endl;
+
+  // Iterate through the arcs and print the IDs of their 
+  // source and target nodes
+  std::cout << "Arcs:";
+  for (ArcIt a(g); a != INVALID; ++a)
+    std::cout << " (" << g.id(g.source(a)) << "," 
+              << g.id(g.target(a)) << ")";
+  std::cout << std::endl << std::endl;
+
+  // Iterate through the arcs and print their length
+  std::cout << "There is a map on the arcs (length):" << std::endl;
+  std::cout << std::endl;
+  for (ArcIt a(g); a != INVALID; ++a)
+    std::cout << "length(" << g.id(g.source(a)) << ","
+              << g.id(g.target(a)) << ")=" << length[a] << std::endl;
+  std::cout << std::endl;
+  
+  return 0;
+}