Doc improvements for Path and PathDumper concepts (#331)

Merge #321

Merge #293

Merge

Small fixes related to BellmanFord (#51)

- Add a missing #include.
- Add a missing const keyword for negativeCycle().
- Test if negativeCycle() is const function.

Merge #68 (Port static graph implementation)

Merge

Make some graph member functions static (#311, #68)

Add a new build() function to StaticDigraph (#68)

This function builds the digraph from an arc list that
contains pairs of integer indices from the range [0..n-1].
It is useful in the cases when you would like to build a
StaticDigraph from scratch, i.e. you do not want to build
another digraph that can be copied using the other build()
function.

Extend the interface of StaticDigraph (#68)
with index(), arc() and node() functions similarly to
other static graph structures.

Add documentation for StaticDigraph (#68)

Small improvements + add tests for StaticDigraph (#68)

Port StaticDigraph from SVN -r3524 (#68)

Small fix in the doc (#179)

Add citations to the min mean cycle classes (#179, #184)

Merge #179 (Port the min mean cycle algorithms)

Add tolerance() functions for MMC classes (#179)

Separate group for the min mean cycle classes (#179)

Simplify comparisons in min mean cycle classes (#179)
using extreme INF values instead of bool flags.

Add HartmannOrlin algorithm class (#179)
This algorithm is an improved version of Karp's original method,
it applies an efficient early termination scheme.
The interface is the same as Karp's and Howard's interface.

Add Karp algorithm class (#179)
based on the MinMeanCycle implementation in SVN -r3436.
The interface is reworked to be the same as Howard's interface.

Rename MinMeanCycle to Howard (#179)

Add a detailed test file for MinMeanCycle and fix test_tools.h (#179)

Rename cyclePath() to cycle() in MinMeanCycle (#179)

Traits class + named parameters for MinMeanCycle (#179)

- Add a Traits class defining LargeValue, Tolerance, Path types.
LargeValue is used for internal computations, it is 'long long'
if the length type is integer, otherwise it is 'double'.
- Add named template parameters for LargeValue and Path types.
- Improve numerical stability: remove divisions from the internal
computations. If the arc lengths are integers, then all used
values are integers (except for the cycleMean() query function,
of course).

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.

Simplify the interface of MinMeanCycle (#179)
Remove init() and reset(), and move their content into findMinMean().

Port MinMeanCycle from SVN -r3524 (#179)
with some doc improvements

Merge #184

Update Doxygen configuration file

Insert citations into the doc (#184)

- Add general citations to modules.
- Add specific citations for max flow and min cost flow algorithms.
- Add citations for the supported LP and MIP solvers.
- Extend the main page.
- Replace inproceedings entries with the journal versions.
- Add a new bibtex entry about network simplex.
- Remove unwanted entries.

Handle url fields in bib2dox.py (#184)
and modify the bibtex file using url fields.

Merge bugfix #322

Distribute LEMONConfig.cmake.in (#322)

Merge bugfix in #250

Merge #317

Remove unnecessary OsiCbc dependency (#317)

Fix (and improve) error message in mip_test.cc (#317)

Add soplex support to scripts/bootstrap.sh plus...
it checks whether cbc and soplex are installed at the given prefix.

Faster add row operation (#203)

One virtual function call instead of more

Improve bib2dox.py using \section for entiries (#184)

Integrate bib2dox.py into the build environments (#184)

Add bib->dox converter and initial references.bib (#184)

Merge #311

Merge

Add a warning for List(Di)Graph::Snapshot (#311)
and extend tests for snapshots

Modify the implementation of ListDigraph::ArcIt (#311)

The new implementation is based on out-arc iteration (like
ListGraph::ArcIt) instead of in-arc iteration to make it
consistent with the documentation.

Much better implementation for node splitting (#311)
in ListDigraph. This solution is the same as the one that
is used in SmartDigraph. It is much faster and does not
invalidate any iterator like the former implementation.

Add a resize() function to HypercubeGraph (#311)
just like the similar functions in other static graph structures,
and extend the test files to check these functions.

Add reserve functions to ListGraph and SmartGraph (#311)
ListDigraph and SmartDigraph already have such functions.

Doc improvements, fixes and unifications for graphs (#311)

Doc improvements and unification for graph concepts (#311)

Copyright notices added to scripts

Simple interactive bootstrap script

Merge #298

Merge