1. 04 Nov, 2007 1 commit
  2. 24 Oct, 2007 3 commits
    • Tiago Peixoto's avatar
      Fix Set{Vertex|Edge}FilterRange() when boundaries are -inf · 8ed48c65
      Tiago Peixoto authored
      This fixes the same problem as commit 6663be71, but which arises
      when a filter range boundary is -inf (such as "<=100").
      8ed48c65
    • Tiago Peixoto's avatar
      Fix vertex and edge filtering, when only one is active · 300d6f4a
      Tiago Peixoto authored
          
      When only one of vertex or edge filtering was disabled, the allowed
      range of the disabled filter was set to
      ]numeric_limits<double>::min(), numeric_limits<double>::max()[, and
      the selected filtering property was the respective index. But
      according to the STL documentation from GCC,
      numeric_limits<>::min() returns:
          
         "The minimum finite value, or for floating types with
          denormalization, the minimum positive normalized value."
          
      which is always positive for double (!), thus introducing a weird
      regression, where the first vertex (index 0) is always filtered out if
      only the edge filter is active, and vice-versa.
      300d6f4a
    • Tiago Peixoto's avatar
      Fix --insert-edge-index · d28e2f34
      Tiago Peixoto authored
      d28e2f34
  3. 23 Oct, 2007 1 commit
    • Tiago Peixoto's avatar
      Fix GetEdgeHistogram() for undirected graphs · 32ae550d
      Tiago Peixoto authored
      The Histogram type 'hist_t' should have a 'double' value, so that
      counts of 1/2 can be added when it's known things are going to be
      counted twice.
      
      (and I don't know what that 'double_t' thing was doing there)
      32ae550d
  4. 15 Oct, 2007 1 commit
  5. 12 Oct, 2007 1 commit
    • Tiago Peixoto's avatar
      Added --purge-edges and --purge-vertices option · 23e319bf
      Tiago Peixoto authored
          
      Filtered vertices and edges can be permanently removed from the graph
      with --purge-vertices and --purge-edges, respectively. The edge or
      vertex filter is automatically removed, afterwards. This is useful if
      maximum speed is necessary, and saving and reloading the graph without
      filtering is not desired.
          
      (this commit also removes some trailing whitespaces)
      23e319bf
  6. 11 Oct, 2007 1 commit
  7. 10 Oct, 2007 5 commits
  8. 08 Oct, 2007 2 commits
  9. 07 Oct, 2007 4 commits
    • Tiago Peixoto's avatar
    • Tiago Peixoto's avatar
      Remove graph rewiring · f618944c
      Tiago Peixoto authored
      Remove graph rewiring for now, since it's quite buggy. It will be
      re-commited when ready.
      f618944c
    • Tiago Peixoto's avatar
      Complete overhaul of command line parsing, and support for loading graph-tool... · cb61cc74
      Tiago Peixoto authored
      Complete overhaul of command line parsing, and support for loading graph-tool as whole as a python module
          
      The command line parsing was completely rewritten. It now supports
      better parsing of sub-options, with type checking and grouping
      support. Error reporting was also significantly improved, and it now
      warns of invalid options and option values, before the option is
      executed. Some syntax has changed, such as range filtering:
      --[vertex|edge]-range-filter was replaced by
      --exclude-[vertex|edge]-range and --keep-[vertex|edge]-range, which
      should have a clearer meaning. Ranges can also be specified now by
      comparison operators (>,<,>=,<=,=), such as ">=10", to indicate a
      range of (10, inf). In addition, ranges can now be easily open or
      closed at either end, by suffixing the specific end with '*', to
      indicate it is closed, ex: "10 700*" means (10,700].
          
      The graph-tool script can now be loaded as a python module (it must be
      renamed first to 'something.py'). All the command line options (except
      'for' and 'history' which become irrelevant) are available as
      functions, with full description and optional parameter support. In
      addition, pure function objects can be given as parameters where
      expressions are asked, instead of strings and files, which enables
      convenient extension of graph-tool.
      cb61cc74
    • Tiago Peixoto's avatar
      fix edge vs. vertex betweenness mixup, and GetCentralPointDominance · 55028b02
      Tiago Peixoto authored
      for undirected graphs
      55028b02
  10. 04 Oct, 2007 1 commit
    • Tiago Peixoto's avatar
      · 8e962092
      Tiago Peixoto authored
      Simplify range filtering, and definitely remove python filtering
          
      Simplify range filtering of vertices and edges, by always filtering
      both at once, even if all vertices or edges are being considered. This
      severely reduces compilation time and memory, at a small potential
      cost in run-time speed, which will probably be overshadowed by other
      things, such as dynamic_map look-ups ("premature optimization is the
      root of all evil"). Also, remove python-filtering, since, in the end,
      it is just code bloat, since it is quite slow for most uses and can be
      replaced, generally, by python property editing + range filtering.
      8e962092
  11. 28 Sep, 2007 1 commit
  12. 14 Sep, 2007 1 commit
  13. 12 Sep, 2007 2 commits
  14. 09 Aug, 2007 1 commit
    • Tiago Peixoto's avatar
      * src/graph-tool: change layout and community graph options. · c3a6567d
      Tiago Peixoto authored
      	* 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
      c3a6567d
  15. 01 Aug, 2007 2 commits
  16. 31 Jul, 2007 2 commits
  17. 30 Jul, 2007 1 commit
  18. 11 Jul, 2007 2 commits
    • Tiago Peixoto's avatar
      * src/graph/graph_extended_clustering.cc... · e5d146c6
      Tiago Peixoto authored
      * src/graph/graph_extended_clustering.cc (GraphInterface::SetExtendedClusteringToProperty): init vector_property_map size, so that access becomes thread safe.
      
      * src/graph/graph_clustering.cc (GraphInterface::SetLocalClusteringToProperty): init vector_property_map size, so that access becomes thread safe.
      
      
      git-svn-id: https://svn.forked.de/graph-tool/trunk@115 d4600afd-f417-0410-95de-beed9576f240
      e5d146c6
    • Tiago Peixoto's avatar
      · 32990eb6
      Tiago Peixoto authored
              * ChangeLog: updated ChangeLog file with svn history
      
              * src/graph/graph_filtering.hh: added add_edge() and remove_edge() functions for filtered graphs
      
              * src/graph/shared_map.hh: included SharedContainer
      
              * src/graph/graph_rewiring.cc: initial support for random graph rewiring
      
      
      
      git-svn-id: https://svn.forked.de/graph-tool/trunk@114 d4600afd-f417-0410-95de-beed9576f240
      32990eb6
  19. 07 Jul, 2007 1 commit
  20. 06 Jul, 2007 1 commit
  21. 05 Jul, 2007 2 commits
  22. 02 Jul, 2007 3 commits
  23. 30 Jun, 2007 1 commit