Context Navigation

Changes in / [239:7b7e3f20bcec:240:bea328c5a8d3] in lemon-main

Files:

-                      r225
+                      r236
 #  OUTPUT_STRIP_TRAILING_WHITESPACE)
 SET(PROJECT_NAME "Lemon")
+SET(PROJECT_NAME "LEMON")
 SET(PROJECT_VERSION_MAJOR "0")
 SET(PROJECT_VERSION_MINOR "99")
 …
     "EGRES - Egervary Research Group on Combinatorial Optimization")
   SET(CPACK_PACKAGE_DESCRIPTION_SUMMARY
     "Lemon - Library of Efficient Models and Optimization in Networks")
+    "LEMON - Library of Efficient Models and Optimization in Networks")
   SET(CPACK_RESOURCE_FILE_LICENSE "${CMAKE_SOURCE_DIR}/LICENSE")
 …
   #SET(CPACK_COMPONENT_HEADERS_DESCRIPTION
   #  "C++ header files for use with the Lemon library")
+  #  "C++ header files for use with the LEMON library")
   #SET(CPACK_COMPONENT_LIBRARY_DESCRIPTION
   #  "Static library used to build programs with Lemon")
+  #  "Static library used to build programs with LEMON")
   #SET(CPACK_COMPONENT_HTML_DOCUMENTATION_DESCRIPTION
   #  "Doxygen generated documentation")
 …
   #SET(CPACK_COMPONENT_GROUP_DEVELOPMENT_DESCRIPTION
   #  "Components needed to develop software using Lemon")
+  #  "Components needed to develop software using LEMON")
   #SET(CPACK_COMPONENT_GROUP_DOCUMENTATION_DESCRIPTION
   #  "Documentation of Lemon")
+  #  "Documentation of LEMON")
   #SET(CPACK_ALL_INSTALL_TYPES Full Developer)

r226	r236
7	7
8	8	AC_PREREQ([2.59])
9		AC_INIT([L~~emon~~], [lemon_version()], [lemon-user@lemon.cs.elte.hu], [lemon])
	9	AC_INIT([LEMON], [lemon_version()], [lemon-user@lemon.cs.elte.hu], [lemon])
10	10	AC_CONFIG_AUX_DIR([build-aux])
11	11	AC_CONFIG_MACRO_DIR([m4])

-                      r210
+                      r236
 maximum cardinality matching.
 Lemon contains the next algorithms:
+LEMON contains the next algorithms:
 - \ref lemon::MaxBipartiteMatching "MaxBipartiteMatching" Hopcroft-Karp
   augmenting path algorithm for calculate maximum cardinality matching in
 …
 /**
 @defgroup lemon_io Lemon Input-Output
+@defgroup lemon_io LEMON Input-Output
 @ingroup io_group
 \brief Reading and writing \ref lgf-format "Lemon Graph Format".
+\brief Reading and writing \ref lgf-format "LEMON Graph Format".
 This group describes methods for reading and writing
 \ref lgf-format "Lemon Graph Format".
+\ref lgf-format "LEMON Graph Format".
 */

r212	r236
22	22
23	23
24		\page lgf-format L~~emon~~ Graph Format (LGF)
	24	\page lgf-format LEMON Graph Format (LGF)
25	25
26	26	The \e LGF is a <em>column oriented</em>

r230	r236
42	42	///
43	43	/// The graph's node and edge sets can be changed as we add or erase
44		/// nodes and edges in the graph. L~~emon~~ would like to handle easily
	44	/// nodes and edges in the graph. LEMON would like to handle easily
45	45	/// that the node and edge maps should contain values for all nodes or
46	46	/// edges. If we want to check on every indicing if the map contains

-                      r220
+                      r236
       void clear() {}
       /// \brief Lemon style iterator for path arcs
+      /// \brief LEMON style iterator for path arcs
       ///
       /// This class is used to iterate on the arcs of the paths.
 …
     /// If we would like to give back a real path from these
     /// algorithms then we should create a temporarly path object. In
     /// Lemon such algorithms gives back a path dumper what can
+    /// LEMON such algorithms gives back a path dumper what can
     /// assigned to a real path and the dumpers can be implemented as
     /// an adaptor class to the predecessor map.
 …
       typedef False RevPathTag;
       /// \brief Lemon style iterator for path arcs
+      /// \brief LEMON style iterator for path arcs
       ///
       /// This class is used to iterate on the arcs of the paths.
 …
       };
       /// \brief Lemon style iterator for path arcs
+      /// \brief LEMON style iterator for path arcs
       ///
       /// This class is used to iterate on the arcs of the paths in

-                      r220
+                      r236
 ///\ingroup lemon_io
 ///\file
 ///\brief \ref lgf-format "Lemon Graph Format" reader.
+///\brief \ref lgf-format "LEMON Graph Format" reader.
 …
   ///
   /// This class can be used to read the sections, the map names and
   /// the attributes from a file. Usually, the Lemon programs know
+  /// the attributes from a file. Usually, the LEMON programs know
   /// that, which type of graph, which maps and which attributes
   /// should be read from a file, but in general tools (like glemon)

r237	r240
19	19	///\ingroup lemon_io
20	20	///\file
21		///\brief \ref lgf-format "L~~emon~~ Graph Format" writer.
	21	///\brief \ref lgf-format "LEMON Graph Format" writer.
22	22
23	23

r220	r236
83	83	}
84	84
85		/// \brief L~~emon~~ style iterator for path arcs
	85	/// \brief LEMON style iterator for path arcs
86	86	///
87	87	/// This class is used to iterate on the arcs of the paths.

-                      r220
+                      r236
+    }
     /// \brief Lemon style iterator for the representant items.
+    /// \brief LEMON style iterator for the representant items.
     ///
     /// ClassIt is a lemon style iterator for the components. It iterates
 …
     };
     /// \brief Lemon style iterator for the items of a component.
+    /// \brief LEMON style iterator for the items of a component.
     ///
     /// ClassIt is a lemon style iterator for the components. It iterates
 …
+    }
     /// \brief Lemon style iterator for the classes.
+    /// \brief LEMON style iterator for the classes.
     ///
     /// ClassIt is a lemon style iterator for the components. It iterates
 …
     };
     /// \brief Lemon style iterator for the items of a component.
+    /// \brief LEMON style iterator for the items of a component.
     ///
     /// ClassIt is a lemon style iterator for the components. It iterates
 …
+    }
     /// \brief Lemon style iterator for the items of a class.
+    /// \brief LEMON style iterator for the items of a class.
     ///
     /// ClassIt is a lemon style iterator for the components. It iterates

Note: See TracChangeset for help on using the changeset viewer.