0
10
0
| ... | ... |
@@ -6,5 +6,5 @@ |
| 6 | 6 |
# OUTPUT_STRIP_TRAILING_WHITESPACE) |
| 7 | 7 |
|
| 8 |
SET(PROJECT_NAME " |
|
| 8 |
SET(PROJECT_NAME "LEMON") |
|
| 9 | 9 |
SET(PROJECT_VERSION_MAJOR "0") |
| 10 | 10 |
SET(PROJECT_VERSION_MINOR "99") |
| ... | ... |
@@ -37,5 +37,5 @@ |
| 37 | 37 |
"EGRES - Egervary Research Group on Combinatorial Optimization") |
| 38 | 38 |
SET(CPACK_PACKAGE_DESCRIPTION_SUMMARY |
| 39 |
" |
|
| 39 |
"LEMON - Library of Efficient Models and Optimization in Networks") |
|
| 40 | 40 |
SET(CPACK_RESOURCE_FILE_LICENSE "${CMAKE_SOURCE_DIR}/LICENSE")
|
| 41 | 41 |
|
| ... | ... |
@@ -58,7 +58,7 @@ |
| 58 | 58 |
|
| 59 | 59 |
#SET(CPACK_COMPONENT_HEADERS_DESCRIPTION |
| 60 |
# "C++ header files for use with the |
|
| 60 |
# "C++ header files for use with the LEMON library") |
|
| 61 | 61 |
#SET(CPACK_COMPONENT_LIBRARY_DESCRIPTION |
| 62 |
# "Static library used to build programs with |
|
| 62 |
# "Static library used to build programs with LEMON") |
|
| 63 | 63 |
#SET(CPACK_COMPONENT_HTML_DOCUMENTATION_DESCRIPTION |
| 64 | 64 |
# "Doxygen generated documentation") |
| ... | ... |
@@ -71,7 +71,7 @@ |
| 71 | 71 |
|
| 72 | 72 |
#SET(CPACK_COMPONENT_GROUP_DEVELOPMENT_DESCRIPTION |
| 73 |
# "Components needed to develop software using |
|
| 73 |
# "Components needed to develop software using LEMON") |
|
| 74 | 74 |
#SET(CPACK_COMPONENT_GROUP_DOCUMENTATION_DESCRIPTION |
| 75 |
# "Documentation of |
|
| 75 |
# "Documentation of LEMON") |
|
| 76 | 76 |
|
| 77 | 77 |
#SET(CPACK_ALL_INSTALL_TYPES Full Developer) |
| ... | ... |
@@ -326,5 +326,5 @@ |
| 326 | 326 |
maximum cardinality matching. |
| 327 | 327 |
|
| 328 |
|
|
| 328 |
LEMON contains the next algorithms: |
|
| 329 | 329 |
- \ref lemon::MaxBipartiteMatching "MaxBipartiteMatching" Hopcroft-Karp |
| 330 | 330 |
augmenting path algorithm for calculate maximum cardinality matching in |
| ... | ... |
@@ -477,10 +477,10 @@ |
| 477 | 477 |
|
| 478 | 478 |
/** |
| 479 |
@defgroup lemon_io |
|
| 479 |
@defgroup lemon_io LEMON Input-Output |
|
| 480 | 480 |
@ingroup io_group |
| 481 |
\brief Reading and writing \ref lgf-format " |
|
| 481 |
\brief Reading and writing \ref lgf-format "LEMON Graph Format". |
|
| 482 | 482 |
|
| 483 | 483 |
This group describes methods for reading and writing |
| 484 |
\ref lgf-format " |
|
| 484 |
\ref lgf-format "LEMON Graph Format". |
|
| 485 | 485 |
*/ |
| 486 | 486 |
| ... | ... |
@@ -42,5 +42,5 @@ |
| 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. |
|
| 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 |
| ... | ... |
@@ -78,5 +78,5 @@ |
| 78 | 78 |
void clear() {}
|
| 79 | 79 |
|
| 80 |
/// \brief |
|
| 80 |
/// \brief LEMON style iterator for path arcs |
|
| 81 | 81 |
/// |
| 82 | 82 |
/// This class is used to iterate on the arcs of the paths. |
| ... | ... |
@@ -201,5 +201,5 @@ |
| 201 | 201 |
/// If we would like to give back a real path from these |
| 202 | 202 |
/// algorithms then we should create a temporarly path object. In |
| 203 |
/// |
|
| 203 |
/// LEMON such algorithms gives back a path dumper what can |
|
| 204 | 204 |
/// assigned to a real path and the dumpers can be implemented as |
| 205 | 205 |
/// an adaptor class to the predecessor map. |
| ... | ... |
@@ -233,5 +233,5 @@ |
| 233 | 233 |
typedef False RevPathTag; |
| 234 | 234 |
|
| 235 |
/// \brief |
|
| 235 |
/// \brief LEMON style iterator for path arcs |
|
| 236 | 236 |
/// |
| 237 | 237 |
/// This class is used to iterate on the arcs of the paths. |
| ... | ... |
@@ -260,5 +260,5 @@ |
| 260 | 260 |
}; |
| 261 | 261 |
|
| 262 |
/// \brief |
|
| 262 |
/// \brief LEMON style iterator for path arcs |
|
| 263 | 263 |
/// |
| 264 | 264 |
/// This class is used to iterate on the arcs of the paths in |
| ... | ... |
@@ -19,5 +19,5 @@ |
| 19 | 19 |
///\ingroup lemon_io |
| 20 | 20 |
///\file |
| 21 |
///\brief \ref lgf-format " |
|
| 21 |
///\brief \ref lgf-format "LEMON Graph Format" reader. |
|
| 22 | 22 |
|
| 23 | 23 |
|
| ... | ... |
@@ -2302,5 +2302,5 @@ |
| 2302 | 2302 |
/// |
| 2303 | 2303 |
/// This class can be used to read the sections, the map names and |
| 2304 |
/// the attributes from a file. Usually, the |
|
| 2304 |
/// the attributes from a file. Usually, the LEMON programs know |
|
| 2305 | 2305 |
/// that, which type of graph, which maps and which attributes |
| 2306 | 2306 |
/// should be read from a file, but in general tools (like glemon) |
| ... | ... |
@@ -498,5 +498,5 @@ |
| 498 | 498 |
} |
| 499 | 499 |
|
| 500 |
/// \brief |
|
| 500 |
/// \brief LEMON style iterator for the representant items. |
|
| 501 | 501 |
/// |
| 502 | 502 |
/// ClassIt is a lemon style iterator for the components. It iterates |
| ... | ... |
@@ -550,5 +550,5 @@ |
| 550 | 550 |
}; |
| 551 | 551 |
|
| 552 |
/// \brief |
|
| 552 |
/// \brief LEMON style iterator for the items of a component. |
|
| 553 | 553 |
/// |
| 554 | 554 |
/// ClassIt is a lemon style iterator for the components. It iterates |
| ... | ... |
@@ -808,5 +808,5 @@ |
| 808 | 808 |
} |
| 809 | 809 |
|
| 810 |
/// \brief |
|
| 810 |
/// \brief LEMON style iterator for the classes. |
|
| 811 | 811 |
/// |
| 812 | 812 |
/// ClassIt is a lemon style iterator for the components. It iterates |
| ... | ... |
@@ -860,5 +860,5 @@ |
| 860 | 860 |
}; |
| 861 | 861 |
|
| 862 |
/// \brief |
|
| 862 |
/// \brief LEMON style iterator for the items of a component. |
|
| 863 | 863 |
/// |
| 864 | 864 |
/// ClassIt is a lemon style iterator for the components. It iterates |
| ... | ... |
@@ -1656,5 +1656,5 @@ |
| 1656 | 1656 |
} |
| 1657 | 1657 |
|
| 1658 |
/// \brief |
|
| 1658 |
/// \brief LEMON style iterator for the items of a class. |
|
| 1659 | 1659 |
/// |
| 1660 | 1660 |
/// ClassIt is a lemon style iterator for the components. It iterates |
0 comments (0 inline)