1 | /* -*- C++ -*- |
---|

2 | * |
---|

3 | * This file is a part of LEMON, a generic C++ optimization library |
---|

4 | * |
---|

5 | * Copyright (C) 2003-2006 |
---|

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 | ///\ingroup demos |
---|

20 | ///\file maps_summary demo program |
---|

21 | ///\brief Introduction to LEMON maps |
---|

22 | /// |
---|

23 | /// \include maps_summary.cc |
---|

24 | |
---|

25 | #include <iostream> |
---|

26 | #include <lemon/list_graph.h> |
---|

27 | |
---|

28 | using namespace lemon; |
---|

29 | |
---|

30 | |
---|

31 | template < typename GRAPH, typename MAP > |
---|

32 | typename MAP::Value summary( GRAPH& gr, MAP& m ) |
---|

33 | { |
---|

34 | typename MAP::Value summ = typename MAP::Value(); |
---|

35 | |
---|

36 | for( typename GRAPH::NodeIt n(gr); n != lemon::INVALID; ++n ) |
---|

37 | summ += m[n]; |
---|

38 | |
---|

39 | return summ; |
---|

40 | } |
---|

41 | |
---|

42 | |
---|

43 | int main( int argc, char *argv[] ) |
---|

44 | { |
---|

45 | ListGraph gr; |
---|

46 | ListGraph::NodeMap<double> value(gr, 0.0); |
---|

47 | |
---|

48 | //TODO: build a graph |
---|

49 | |
---|

50 | std::cout << "The summary of assigned values is " << summary(gr,value) << std::endl; |
---|

51 | |
---|

52 | return 0; |
---|

53 | } |
---|