GitLab

This removes reverse_graph.hpp, reverse_graph.hpp and copy.hpp, and
introduces some modifications in graph_adaptor.hh. This modification
fixes compilation problems across different boost versions.

This also keeps compatibility with earlier versions of boost.

This also maintains compatibility with older boost versions.

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.

Fix compilation warnings with boost 1.40, remove unnecessary files, fix
autoconf macros and link with "boost_graph".

This also raises the minimum boost version to 1.40.

Properties with empty values are now simply not printed in the output.

This is a large commit which replaces lambda::bind with boost::bind in
most parts of the code. This improves compilation time, and slightly
decreases compilation memory usage in some cases.

This implements an efficient motif counting algorithm.

This fixes bug where boost overlay files were not being used, when not
compiling from source dir.

This includes a new vector property map type (fast_vector_property_map)
which has optional disabling of bounds checking, through its associate
map type (unchecked_fast_vector_property_map). This should improve
performance on algorithms which depend on tight loops which access
property maps.

Bounds checking is only disabled locally just before the algorithms run,
and proper care is taken for bounds checking _beforehand_. The property
maps exposed to python still have internal bounds checking.

A property map object has now a get_array() member which returns an internally
owned array pointing to the property values.

Now graphml files properly contain all the supported value types, which
are all perfectly preserved when read (floating point data is now saved
in hexadecimal format). Several other improvements were made, such as
the ability to read and write to python file-like objects.

It is also now possible to have arbitrary python object properties, and
store them persistently (which is done internally with the pickling
interface).

vector<bool> was totally abolished, since its implementation is quite
broken. See: http://www.gotw.ca/publications/N1211.pdf and
http://www.gotw.ca/publications/N1185.pdf Now a uint8_t (aka. char) is
used in graph properties instead of a bool.

Graph types can now be fully pickled (this may not be feasible
memory-wise if the graph is too large, since the whole XML
representation is dumped to a string before it is saved on disc).

This commit splits libraph_tool into different libraries:
 
   - libgraph_tool_core
   - libgraph_tool_clustering (*)
   - libgraph_tool_community (*)
   - libgraph_tool_correlations (*)
   - libgraph_tool_distance (*)
   - libgraph_tool_generation (*)
   - libgraph_tool_layout (*)
   - libgraph_tool_misc (*)
   - libgraph_tool_stats (*)

It also adds the python sub-module 'test', which provides extensive unit
testing of the core functionality. The core library is fully functional
and all test pass successfully.

(*) -> module needs to be ported to new refactoring, and does not yet build

This will increase memory usage, but guarantees, across different
platforms, that 'long' will always hold larger values than 'int'.

	* src/boost-workaround/boost/graph/kamada_kawai_spring_layout.hpp: annotated code with openmp constructs.

	* src/graph/graph_adaptor.hh: graph_type should be a typedef to the original graph.

	* src/graph/graph_properties.hh, src/graph/graph_properties.cc: added pos_t type.

	* src/boost-workaround/boost/graph/fruchterman_reingold.hpp: annotated code with openmp constructs.

	* src/graph/graph_layout.cc: new file with graph layout routines.

	* src/graph/graph.cc: removed graph layout routines.

	* src/graph/graph_community_network.cc (struct get_community_network): fixed inversion of directedness test.

	* src/graph/graph.cc (GraphInterface::LabelComponents): use vector_property_map instead of HashedDescriptor. Don't use a static map!

	* src/graph/graph_adaptor.hh: fixed edge descriptor equality comparison, which must rely on underlying edge, regardless of whether it's inverted or not.


git-svn-id: https://svn.forked.de/graph-tool/trunk@121 d4600afd-f417-0410-95de-beed9576f240

* change from HashedDescriptorMap to vector_property_map in several
  algorithms to save memory and increase speed in the most common
  case, where the graph is unfiltered.




git-svn-id: https://svn.forked.de/graph-tool/trunk@102 d4600afd-f417-0410-95de-beed9576f240

  * src/graph/graph_clustering.cc
  * src/graph/graph_distance.cc
  * src/graph/graph_extended_clustering.cc
  * src/graph/graph_distance_sampled.cc
* fixed "jacknife" variance bug in src/graph/graph_clustering.cc



git-svn-id: https://svn.forked.de/graph-tool/trunk@97 d4600afd-f417-0410-95de-beed9576f240

* added support for specifying property type when creating/editing properties
* added initial support for graph properties (are loaded, listed, and saved)


git-svn-id: https://svn.forked.de/graph-tool/trunk@81 d4600afd-f417-0410-95de-beed9576f240

git-svn-id: https://svn.forked.de/graph-tool/trunk@78 d4600afd-f417-0410-95de-beed9576f240

git-svn-id: https://svn.forked.de/graph-tool/trunk@1 d4600afd-f417-0410-95de-beed9576f240