Location: LEMON/LEMON-main/doc/mainpage.dox - annotation
Load file history
Rework and fix the implementation of MinMeanCycle (#179)
- Fix the handling of the cycle means.
- Many implementation improvements:
- More efficient data storage for the strongly connected
components.
- Better handling of BFS queues.
- Merge consecutive BFS searches (perform two BFS searches
instead of three).
This version is about two times faster on average and an order of
magnitude faster if there are a lot of strongly connected components.
r209:765619b7cbb2 r40:8f4e8273a458 r209:765619b7cbb2 r40:8f4e8273a458 r440:88ed40ad0d4f r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r658:ebdcc68fe79e r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r40:8f4e8273a458 r651:3adf5e2d1e62 r559:c5fd2d996909 r40:8f4e8273a458 r651:3adf5e2d1e62 r559:c5fd2d996909 r40:8f4e8273a458 r314:2cc60866a0c9 r314:2cc60866a0c9 r40:8f4e8273a458 | /* -*- mode: C++; indent-tabs-mode: nil; -*-
*
* This file is a part of LEMON, a generic C++ optimization library.
*
* Copyright (C) 2003-2009
* 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.
*
*/
/**
\mainpage LEMON Documentation
\section intro Introduction
\subsection whatis What is LEMON
LEMON stands for <b>L</b>ibrary for <b>E</b>fficient <b>M</b>odeling
and <b>O</b>ptimization in <b>N</b>etworks.
It is a C++ template
library aimed at combinatorial optimization tasks which
often involve in working
with graphs.
<b>
LEMON is an <a class="el" href="http://opensource.org/">open source</a>
project.
You are free to use it in your commercial or
non-commercial applications under very permissive
\ref license "license terms".
</b>
\subsection howtoread How to read the documentation
If you would like to get to know the library, see
<a class="el" href="http://lemon.cs.elte.hu/pub/tutorial/">LEMON Tutorial</a>.
If you know what you are looking for, then try to find it under the
<a class="el" href="modules.html">Modules</a> section.
If you are a user of the old (0.x) series of LEMON, please check out the
\ref migration "Migration Guide" for the backward incompatibilities.
*/
|