1. 09 Mar, 2009 2 commits
  2. 01 Mar, 2009 2 commits
  3. 22 Feb, 2009 1 commit
  4. 17 Feb, 2009 1 commit
    • Tiago Peixoto's avatar
      Add convenient neighbour traversal functions · 52eaa36f
      Tiago Peixoto authored
      Add support for v.{out|in}_neighbours(), for direct iteration over the
      neighbours, as well as v.all_edges() and v.all_neighbours(). This also
      properly exports the Vertex and Edge classes, with docstrings.
      52eaa36f
  5. 14 Feb, 2009 2 commits
  6. 10 Feb, 2009 3 commits
  7. 06 Feb, 2009 11 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
    • Ale Abdo's avatar
      Improves small fix for 64bit architectures. · 2586bae6
      Ale Abdo authored
      graph_rewiring.cc: use static_cast<rng_t::result_type> instead of
      uint32_t to convert the seed value for the rng_t constructor, so
      the code becomes compatible with any rng_t.
      2586bae6
    • Tiago Peixoto's avatar
      Improve run_action module · 0c87c492
      Tiago Peixoto authored
      Now inline() automatically converts known variables (such as property
      maps) and defaults to boost::python objects, instead of scxx objects.
      
      The code now is only generated for the current filtered, reversed and/or
      directed status of the graph, reducing compile time and binary size.
      
      Edge modification (remove and add) is now protected by a GraphWrap
      class, which takes care of the edge index housekeeping, which does not
      need to be done by hand anymore.
      
      The function is also no longer bound to one graph, and can take an
      arbitrary number of variables of known or unknown types, including
      graphs.
      0c87c492
    • Tiago Peixoto's avatar
      Fix edge index housekeeping · ba56ebd9
      Tiago Peixoto authored
      ba56ebd9
    • Tiago Peixoto's avatar
      Fix symbol visibility · d6422b73
      Tiago Peixoto authored
      Now all symbols are exported by default, except those strictly marked
      as hidden.
      d6422b73
    • Tiago Peixoto's avatar
      Autoconf clean-up and new m4 macros · b5da5356
      Tiago Peixoto authored
      b5da5356
    • Tiago Peixoto's avatar
      Fix compilation in 64 bit architecture · 4a9bf9f6
      Tiago Peixoto authored
      4a9bf9f6
    • Tiago Peixoto's avatar
      Fix small warning in community code · 7ea1d8c4
      Tiago Peixoto authored
      7ea1d8c4
    • Tiago Peixoto's avatar
      Disable internal bounds checking in property maps · 0ababf9c
      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.
      0ababf9c
    • Tiago Peixoto's avatar
      Add direct support for degree propery map creation · 8ae75c9f
      Tiago Peixoto authored
      i.e. g.degree_property_map("in") will create and return a vertex property map
      which corresponds to the in-degrees of the vertices. This is useful for
      temporarily modifying or getting an array of degrees.
      8ae75c9f
    • 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
  8. 18 Jan, 2009 1 commit
  9. 11 Jan, 2009 1 commit
  10. 07 Dec, 2008 1 commit
  11. 03 Dec, 2008 1 commit
  12. 02 Dec, 2008 1 commit
  13. 01 Dec, 2008 1 commit
  14. 26 Oct, 2008 1 commit
  15. 23 Oct, 2008 2 commits
  16. 21 Oct, 2008 1 commit
    • Tiago Peixoto's avatar
      Rewiring: bugfix, improvements and restructuring resulting in cleaner and faster code · b1e1bc5e
      Tiago Peixoto authored
      Restructure the rewiring code, introducing further abstraction through
      class inheritance.
      
      Both uncorrelated and correlated cases draw edges directly.
      This has actually proven faster than drawing vertices for the correlated
      case, since realizing that indexes could be stored instead of edges.
      Doing so avoids changes in the pool of candidate edges, which in turn
      removes the need to rebuild it for each edge to rewire.
      Consequently, it also makes the uncorrelated case a lot quicker.
      
      In the uncorrelated undirected case, the new code also fixes a serious
      bug: when building the edge pool, only one end of each edge was looked
      at, because the "edges" vector is not equivalent to drawing all
      out_edges from all vertices, as is done now.
      b1e1bc5e
  17. 20 Oct, 2008 1 commit
  18. 13 Oct, 2008 1 commit
  19. 10 Oct, 2008 2 commits
  20. 07 Oct, 2008 2 commits
    • Tiago Peixoto's avatar
      Makefiles: AM_CPPFLAGS use srcdir · 1c84328d
      Tiago Peixoto authored
      Add $(srcdir) to include paths in AM_CPPFLAGS so that we can
      compile the program writing all targets into a directory separate
      from the sources.
      This is done simply by creatig a subdirectory of the project root
      and running "../configure" and "make" inside it.
      1c84328d
    • Tiago Peixoto's avatar
      Add dedicated average correlation calculation · 48aec77d
      Tiago Peixoto authored
      This is a re-implementation based on new histogram code, which does not
      build a 2D histogram, and is thus more exact and uses less memory.
      48aec77d
  21. 24 Sep, 2008 1 commit
    • Tiago Peixoto's avatar
      Fix edge indexing problem when modifying graph · dc184b46
      Tiago Peixoto authored
      This fixes a rather central bug, which causes duplicated indexes if
      edges are removed and then new ones are added. Edge indexes are now
      recycled as they are removed and then new ones are added. This still
      guarantees O(1) complexity when adding or removing edges.
      dc184b46
  22. 27 Jul, 2008 1 commit