1. 20 Sep, 2018 1 commit
  2. 14 Feb, 2018 1 commit
  3. 01 Jan, 2017 1 commit
  4. 26 Oct, 2016 1 commit
  5. 13 Oct, 2016 1 commit
  6. 10 Jul, 2016 1 commit
  7. 12 Jan, 2016 1 commit
  8. 01 Jan, 2016 1 commit
  9. 26 Dec, 2015 1 commit
  10. 05 Oct, 2015 1 commit
  11. 13 Sep, 2015 2 commits
  12. 08 Jan, 2015 1 commit
  13. 02 Jan, 2014 1 commit
  14. 10 Nov, 2013 1 commit
  15. 06 Jan, 2013 1 commit
  16. 02 May, 2012 1 commit
  17. 10 Feb, 2011 1 commit
  18. 13 Nov, 2010 1 commit
  19. 07 Mar, 2010 1 commit
  20. 18 Sep, 2009 1 commit
    • Tiago Peixoto's avatar
      Edge and vertex descriptors now carry a weakref to their Graphs · c6c01d62
      Tiago Peixoto authored
      This fixes an obvious problem, where the graph gets deleted, and the
      descriptors are still lying around. Usage of orphaned descriptors will
      now just raise a ValueError.
      
      The __repr__ function of Edge, Vertex, and PropertyMap now give
      something more informative about each object.
      c6c01d62
  21. 16 Aug, 2009 1 commit
  22. 10 Mar, 2009 1 commit
    • Tiago Peixoto's avatar
      Implement optional wrapping of graphs to deal with edge index housekeeping · 684efca7
      Tiago Peixoto authored
      Thins changes the graph filtering code slightly to wrap graph types with
      GraphWrap, which automatically updates the edge index list when edges
      are removed and added to the graph.
      
      This also changes how graphs are passed to algorithms, which is now by
      reference instead of pointer. (hence this touches lots of code, but
      changes are trivial)
      684efca7
  23. 06 Feb, 2009 2 commits
    • Tiago Peixoto's avatar
      Fix get_array() for property maps · 548d61bb
      Tiago Peixoto authored
      This includes the missing function declarations for edge and graph
      properties.
      
      Property maps of value type "string" do not return an array, since the
      numpy string and std::string are different things.
      548d61bb
    • Tiago Peixoto's avatar
      Add support for array access to property maps · e84aaf3c
      Tiago Peixoto authored
      A property map object has now a get_array() member which returns an internally
      owned array pointing to the property values.
      e84aaf3c
  24. 17 Jun, 2008 1 commit
    • Tiago Peixoto's avatar
      Externalize property maps by default · e984bf8e
      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.
      e984bf8e
  25. 09 May, 2008 1 commit
  26. 06 May, 2008 1 commit
  27. 27 Mar, 2008 1 commit
    • Tiago Peixoto's avatar
      Port graph I/O to new filtering engine, enable graph pickling, and fix several issues · 99bf21c8
      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).
      99bf21c8
  28. 17 Feb, 2008 1 commit
    • Tiago Peixoto's avatar
      Split libgraph_tool into sub-modules and add test cases · 3cfff0cb
      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
      3cfff0cb
  29. 10 Feb, 2008 1 commit
    • Tiago Peixoto's avatar
      Refactor metaprogramming engine · 0b66e272
      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.
      0b66e272