0
6
0
3
3
| ... | ... |
@@ -44,7 +44,7 @@ |
| 44 | 44 |
SET(CPACK_PACKAGE_NAME ${PROJECT_NAME})
|
| 45 | 45 |
SET(CPACK_PACKAGE_VENDOR "EGRES") |
| 46 | 46 |
SET(CPACK_PACKAGE_DESCRIPTION_SUMMARY |
| 47 |
"LEMON - Library |
|
| 47 |
"LEMON - Library for Efficient Modeling and Optimization in Networks") |
|
| 48 | 48 |
SET(CPACK_RESOURCE_FILE_LICENSE "${PROJECT_SOURCE_DIR}/LICENSE")
|
| 49 | 49 |
|
| 50 | 50 |
SET(CPACK_PACKAGE_VERSION ${PROJECT_VERSION})
|
| 1 |
================================================================== |
|
| 2 |
LEMON - a Library of Efficient Models and Optimization in Networks |
|
| 3 |
================================================================== |
|
| 1 |
===================================================================== |
|
| 2 |
LEMON - a Library for Efficient Modeling and Optimization in Networks |
|
| 3 |
===================================================================== |
|
| 4 | 4 |
|
| 5 | 5 |
LEMON is an open source library written in C++. It provides |
| 6 | 6 |
easy-to-use implementations of common data structures and algorithms |
| ... | ... |
@@ -138,16 +138,6 @@ |
| 138 | 138 |
*/ |
| 139 | 139 |
|
| 140 | 140 |
/** |
| 141 |
@defgroup semi_adaptors Semi-Adaptor Classes for Graphs |
|
| 142 |
@ingroup graphs |
|
| 143 |
\brief Graph types between real graphs and graph adaptors. |
|
| 144 |
|
|
| 145 |
This group contains some graph types between real graphs and graph adaptors. |
|
| 146 |
These classes wrap graphs to give new functionality as the adaptors do it. |
|
| 147 |
On the other hand they are not light-weight structures as the adaptors. |
|
| 148 |
*/ |
|
| 149 |
|
|
| 150 |
/** |
|
| 151 | 141 |
@defgroup maps Maps |
| 152 | 142 |
@ingroup datas |
| 153 | 143 |
\brief Map structures implemented in LEMON. |
| ... | ... |
@@ -23,8 +23,7 @@ |
| 23 | 23 |
|
| 24 | 24 |
\subsection whatis What is LEMON |
| 25 | 25 |
|
| 26 |
LEMON stands for |
|
| 27 |
<b>L</b>ibrary of <b>E</b>fficient <b>M</b>odels |
|
| 26 |
LEMON stands for <b>L</b>ibrary for <b>E</b>fficient <b>M</b>odeling |
|
| 28 | 27 |
and <b>O</b>ptimization in <b>N</b>etworks. |
| 29 | 28 |
It is a C++ template |
| 30 | 29 |
library aimed at combinatorial optimization tasks which |
| ... | ... |
@@ -22,7 +22,7 @@ |
| 22 | 22 |
#include <lemon/core.h> |
| 23 | 23 |
#include <lemon/bits/edge_set_extender.h> |
| 24 | 24 |
|
| 25 |
/// \ingroup |
|
| 25 |
/// \ingroup graphs |
|
| 26 | 26 |
/// \file |
| 27 | 27 |
/// \brief ArcSet and EdgeSet classes. |
| 28 | 28 |
/// |
| ... | ... |
@@ -230,7 +230,7 @@ |
| 230 | 230 |
|
| 231 | 231 |
}; |
| 232 | 232 |
|
| 233 |
/// \ingroup |
|
| 233 |
/// \ingroup graphs |
|
| 234 | 234 |
/// |
| 235 | 235 |
/// \brief Digraph using a node set of another digraph or graph and |
| 236 | 236 |
/// an own arc set. |
| ... | ... |
@@ -654,7 +654,7 @@ |
| 654 | 654 |
|
| 655 | 655 |
}; |
| 656 | 656 |
|
| 657 |
/// \ingroup |
|
| 657 |
/// \ingroup graphs |
|
| 658 | 658 |
/// |
| 659 | 659 |
/// \brief Graph using a node set of another digraph or graph and an |
| 660 | 660 |
/// own edge set. |
| ... | ... |
@@ -913,7 +913,7 @@ |
| 913 | 913 |
}; |
| 914 | 914 |
|
| 915 | 915 |
|
| 916 |
/// \ingroup |
|
| 916 |
/// \ingroup graphs |
|
| 917 | 917 |
/// |
| 918 | 918 |
/// \brief Digraph using a node set of another digraph or graph and |
| 919 | 919 |
/// an own arc set. |
| ... | ... |
@@ -1257,7 +1257,7 @@ |
| 1257 | 1257 |
|
| 1258 | 1258 |
}; |
| 1259 | 1259 |
|
| 1260 |
/// \ingroup |
|
| 1260 |
/// \ingroup graphs |
|
| 1261 | 1261 |
/// |
| 1262 | 1262 |
/// \brief Graph using a node set of another digraph or graph and an |
| 1263 | 1263 |
/// own edge set. |
| ... | ... |
@@ -4,7 +4,7 @@ |
| 4 | 4 |
includedir=@includedir@ |
| 5 | 5 |
|
| 6 | 6 |
Name: @PACKAGE_NAME@ |
| 7 |
Description: Library |
|
| 7 |
Description: Library for Efficient Modeling and Optimization in Networks |
|
| 8 | 8 |
Version: @PACKAGE_VERSION@ |
| 9 | 9 |
Libs: -L${libdir} -lemon @GLPK_LIBS@ @CPLEX_LIBS@ @SOPLEX_LIBS@ @CLP_LIBS@ @CBC_LIBS@
|
| 10 | 10 |
Cflags: -I${includedir}
|
0 comments (0 inline)