- 23 Dec, 2009 1 commit
-
-
Tiago Peixoto authored
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.
-
- 22 Dec, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 14 Dec, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
It is necessary to use -frounding-math to avoid run-time errors with certain versions of CGAL.
-
- 13 Dec, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 06 Dec, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
This also includes the library CGAL as a dependency.
-
- 05 Dec, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 01 Dec, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 06 Nov, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 05 Nov, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
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.
-
- 05 Oct, 2009 3 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 06 Sep, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 03 Sep, 2009 1 commit
-
-
Tiago Peixoto authored
This implements a layout module (called 'draw' from python) with an implementation of the arf spring-block layout.
-
- 21 Aug, 2009 2 commits
-
-
Tiago Peixoto authored
This includes the edmonds karp, push relabel and kolmogorov maximum flow algorithms from the BGL.
-
Tiago Peixoto authored
-
- 16 Aug, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 02 Aug, 2009 1 commit
-
-
Tiago Peixoto authored
This prints useful library information.
-
- 01 Mar, 2009 1 commit
-
-
Tiago Peixoto authored
This fixes bug where boost overlay files were not being used, when not compiling from source dir.
-
- 21 Feb, 2009 1 commit
-
-
Tiago Peixoto authored
Make sure libtool is properly modified, by doing it last in configure.ac.
-
- 14 Feb, 2009 1 commit
-
-
Tiago Peixoto authored
This adds the centrality module, which supports betweenness, eigentrust, pagerank and absolute trust.
-
- 06 Feb, 2009 2 commits
-
-
Tiago Peixoto authored
Now all symbols are exported by default, except those strictly marked as hidden.
-
Tiago Peixoto authored
-
- 07 Dec, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 01 Dec, 2008 1 commit
-
-
Tiago Peixoto authored
This includes the community sub-module.
-
- 26 Oct, 2008 1 commit
-
-
Tiago Peixoto authored
Add global variables to configure.ac, to avoid unnecessary multiple definitions.
-
- 23 Oct, 2008 1 commit
-
-
Tiago Peixoto authored
This also creates the misc sub-module. This may be re-organized in the future.
-
- 13 Oct, 2008 2 commits
-
-
Tiago Peixoto authored
This contains at the moment functions to perform basic vertex and edge searches.
-
Tiago Peixoto authored
This allows specifying where numpy and scipy are installed, which can be useful when installing graph_tool in a different location.
-
- 15 Jul, 2008 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
A new 'clustering' sub-module was created.
-
- 15 Apr, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 14 Apr, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 10 Apr, 2008 1 commit
-
-
Tiago Peixoto authored
The whole histogram code has been redone, and the code has been simplified. The three-point vertex-edge-vertex correlation has been scrapped, since it's not frequently used, and would make compilation even more expensive. This also adds some missing files to the generation routine.
-
- 17 Feb, 2008 1 commit
-
-
Tiago Peixoto authored
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
-
- 10 Feb, 2008 1 commit
-
-
Tiago Peixoto authored
This is a huge commit which completely refactors the metaprogramming engine which generates and selects (at run time) the graph view type and the desired algorithm implementation (template instantiation) that runs on it. Things are laid out now as following. There exists a main underlying graph type (GraphInterface::multigraph_t) and several other template classes that mask it some way or another, in a hierarchic fashion: multigraph_t -> filtered_graph (edges only, vertices only, both) | | | | | | | | |-------(reversed_graph)--------|-----------|-----------| | | | | \------(UndirectedAdaptor)------------------------------/ The filtered_graph filters out edges and/or vertices from the graph based on some scalar boolean property. The reversed_graph reversed the direction of the edges and, finally, the UndirectedAdaptor treats the original directed graphs as undirected, transversing the in- and out-edges of each vertex indifferently. Thus, the total number of graph view types is 12. (The option --disable-graph-filtering can be passed to the configure script, which will disable graph filtering altogether and bring the total number down to 3, to reduce compile time and memory usage) In general, some specific algorithm, implemented as a template function object, needs to be instantiated for each of those types. Furthermore, the algorithm may also depend on other types, such as specific property_maps. Thus, the following scheme is used: struct my_algorithm // algorithm to be implemented { template <class Graph, class PropertyMap> void operator()(Graph *g, PropertyMap p, double& result) const { // ... } }; // in order for the above code to be instantiated at compile time // and selected at run time, the run_action template function object // is used from a member function of the GraphInterface class: double GraphInterface::MyAlgorithm(string prop_name) { double result; boost::any vprop = prop(property, _vertex_index, _properties); run_action<>()(*this, bind<void>(my_algorithm(), _1, _2, var(result)), vertex_scalar_properties())(vprop); return result; } The whole code was changed to reflect this scheme, but now things are more centralized and less ad-hoc code needed to be written. Unfortunately, due to GCC's high memory usage during template instantiations, some of the code (namely all the degree correlation things) had to be split in multiple compilation units... Maybe this will change in the future if GCC gets optimized. This commit also touches other parts of code. More specifically, the way filtering gets done is very different. Now we only filter on boolean properties, and with the above scheme, the desired implementation runs with the correct chosen type, and no implicit type conversions should ever happen, which would have a bad impact on performance.
-
- 24 Jan, 2008 1 commit
-
-
Tiago Peixoto authored
The '-E' flag is necessary with GNU ld so that all dynamic symbols are properly exported, and things like typeid() work across DSO boundaries. However there are other linkers out there which don't accept this option. This commit checks for this and drops the option in that case. Let us hope those linkers do the right thing, or wait until someone complains...
-