- 05 Nov, 2015 1 commit
-
-
Tiago Peixoto authored
-
- 17 Sep, 2015 1 commit
-
-
Tiago Peixoto authored
-
- 14 Sep, 2015 1 commit
-
-
Tiago Peixoto authored
-
- 13 Sep, 2015 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 08 Jan, 2015 1 commit
-
-
Tiago Peixoto authored
-
- 18 Aug, 2014 1 commit
-
-
Tiago Peixoto authored
-
- 27 Jul, 2014 1 commit
-
-
Tiago Peixoto authored
-
- 31 May, 2014 2 commits
-
-
Tiago Peixoto authored
Now, if either vertex or edge filtering is enabled, simultaneous filtering is activated. By not considering vertex or edge filtering in completely independent fashion, the compile time memory requirements reduced to about 50%.
-
Tiago Peixoto authored
-
- 02 Jan, 2014 1 commit
-
-
Tiago Peixoto authored
-
- 10 Nov, 2013 1 commit
-
-
Tiago Peixoto authored
-
- 11 Feb, 2013 1 commit
-
-
Tiago Peixoto authored
Dumping boost::adjacency_list<> improves memory usage by a factor of two, and also slightly improves performance in some cases.
-
- 06 Jan, 2013 1 commit
-
-
Tiago Peixoto authored
-
- 28 Nov, 2012 1 commit
-
-
Tiago Peixoto authored
-
- 02 May, 2012 1 commit
-
-
Tiago Peixoto authored
-
- 11 Apr, 2012 1 commit
-
-
Tiago Peixoto authored
After the removal of filtered vertices via Graph.purge_vertices(), the values of known property maps are now kept consistent with the unmodified graph.
-
- 10 Feb, 2011 1 commit
-
-
Tiago Peixoto authored
-
- 02 Feb, 2011 1 commit
-
-
Tiago Peixoto authored
This implements a GraphView class which allows for convenient, independent filtering graphs.
-
- 13 Nov, 2010 1 commit
-
-
Tiago Peixoto authored
-
- 30 Jul, 2010 1 commit
-
-
Tiago Peixoto authored
These functions/properties provide more information and control about edge indexing, which might be useful.
-
- 07 Mar, 2010 1 commit
-
-
Tiago Peixoto authored
-
- 04 Feb, 2010 1 commit
-
-
Tiago Peixoto authored
This fixes a crash when purging filtered vertices.
-
- 28 Jan, 2010 1 commit
-
-
Tiago Peixoto authored
-
- 14 Feb, 2009 1 commit
-
-
Tiago Peixoto authored
This makes the naming more sensible.
-
- 06 Feb, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
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.
-
- 21 Jul, 2008 1 commit
-
-
Tiago Peixoto authored
Also, get rid of g.underlying_graph(), and rely on "private" variable g._Graph__graph instead.
-
- 17 Jun, 2008 1 commit
-
-
Tiago Peixoto authored
This commit removes the internal property maps from the GraphInterface class, and makes all property maps external by default. The internal property maps were moved to the python layer.
-
- 01 Jun, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 06 May, 2008 1 commit
-
-
Tiago Peixoto authored
It was needlessly O(E^2), and now is O(E).
-
- 02 May, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 27 Mar, 2008 1 commit
-
-
Tiago Peixoto authored
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).
-
- 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.
-