GitLab

Support for edge/vertex labelling is 99% done, but it is currently
impractical to compile with GCC. If GCC 4.5 doesn't do a better job,
then a workaround would be necessary.

This also cleans up some m4 boost macros, and includes other small
corrections to configure.ac.

This allows compilation with older versions of boost (>=1.38), which in
some sistems are the only option. This commit also removes the linking
of the boost_graph shared library, since none of its symbols are
actually required.

This implements a simpler rewire strategy where the edges are randomly
placed, without preserving the degrees of the vertices.

It is necessary to use -frounding-math to avoid run-time errors with
certain versions of CGAL.

This also includes the library CGAL as a dependency.

This is a wrapper around BGL's boyer_myrvold_planarity_test.

Now use _best weights_ to in-neighbours to determine trust, to avoid path
multiplicity catastrophe.

This also adds the epsilon parameter, which drops paths with weight
below this value.

It is now possible to obtain the vertex with index i even for filtered graphs.