- 30 Jul, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 17 Jul, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 15 Jul, 2009 8 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
Python types cannot be checked in parallel. This commit forces the number of threads to be 1 in such case.
-
Tiago Peixoto authored
This changes degree_selector(). Now all properties should be tested, not only scalar properties. Later it can be decided which properties are valid.
-
Tiago Peixoto authored
random_graph() now uses a modified algorithm for generation of correlated graphs, which is more efficient. Instead of giving a function which returns a sample of the correlated target degree, the user must give a function which will just compute its probability. This probability will then be used to choose the edges.
-
Tiago Peixoto authored
This also simplifies the calculation of the coefficient.
-
Tiago Peixoto authored
This modified several docstrings and introduces a quick-start guide.
-
- 11 Jun, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 02 Jun, 2009 2 commits
-
-
Ale Abdo authored
-
Tiago Peixoto authored
-
- 23 May, 2009 5 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
The generators from boost::random seem to have a bug which causes them to be biased. The generators from tr1::random seem to be in better shape. See: http://thread.gmane.org/gmane.comp.lib.boost.user/48006
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
Now the parameter "all" is ignored, if any of the other parameters is True.
-
- 15 May, 2009 2 commits
-
-
Tiago Peixoto authored
The following is now possible: g = Graph(directed=False) Instead of the only way previously: g = Graph() g.set_directed(False)
-
Tiago Peixoto authored
The following conversions are now possible: int(v) and tuple(e), where v and e are Vertex and Edge instances, respectively.
-
- 11 May, 2009 6 commits
-
-
Tiago Peixoto authored
Now paths are weighted according to their trust value until the last hop, and paths are not counted twice.
-
Tiago Peixoto authored
Vertex/edge colors are properly plotted even when value range is zero lenght. The behaviour of the 'fork' option was slightly modified.
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 08 May, 2009 3 commits
-
-
Tiago Peixoto authored
graph_draw() won't work if gv is not available, and just a warning is printed... This makes graph_tool.all work when gv is not available.
-
Tiago Peixoto authored
Fix bad_any_cast bug when passing a weight property.
-
Tiago Peixoto authored
-
- 26 Apr, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
This fully documents the centrality module.
-
- 25 Apr, 2009 4 commits
-
-
Tiago Peixoto authored
The function directed() no longer exists, is_directed() should be used instead.
-
Tiago Peixoto authored
-
Tiago Peixoto authored
The _max_edge_index variable was not set when reading a graph, which caused memory corruption when deleting and adding edges.
-
Tiago Peixoto authored
Now all filters are stashed by default. In order to override this, the parameter all=False needs to be passed, and the individual filters need to be specified.
-
- 24 Apr, 2009 3 commits
-
-
Tiago Peixoto authored
This also doesn't build a parallel vertex list if motifs aren't being sampled.
-
Tiago Peixoto authored
This includes the function motif_significance() into the clustering module.
-
Tiago Peixoto authored
This changes the meaning of the all_selectors type, which includes all property types, and creates a scalar_selectors type, which includes only the scalar types.
-