 13 Jul, 2010 4 commits


Tiago Peixoto authored

Tiago Peixoto authored

Tiago Peixoto authored
Now the meaning of the bin edges given to the several histogram functions are the same as in numpy/scipy. This means that the last bin edge represents an upper bound on the last bin.

Tiago Peixoto authored
This fixes a bug in the motifs() code which generates a segfault for certain subgraph signatures. This also fixes a potential problem for multithreaded execution.

 08 Jul, 2010 1 commit


Tiago Peixoto authored
This fixes a race condition when undirected graphs are used, and when OpenMP is enabled.

 06 Jul, 2010 1 commit


Tiago Peixoto authored
This fixes a bug where the distance map was not properly initialized when the graph is filtered, and the all pairs shortest paths are requested.

 06 Jun, 2010 2 commits


Tiago Peixoto authored

Tiago Peixoto authored

 04 Jun, 2010 1 commit


Tiago Peixoto authored

 22 May, 2010 1 commit


Tiago Peixoto authored
This allows for sampling of random subgraph isomorphisms.

 21 May, 2010 5 commits


Tiago Peixoto authored
Now vector types of property maps can be accessed as arrays with the get_array() and 'a' property, just like scalar property maps.

Tiago Peixoto authored
This fixes a small typo bug, which prevented loading from filelike objects.

Tiago Peixoto authored

Tiago Peixoto authored
Edges were not properly indexed after graph generation.

Tiago Peixoto authored

 20 May, 2010 1 commit


Tiago Peixoto authored
This improves the binning performace, when suplied bins are of constant width.

 11 May, 2010 3 commits


Tiago Peixoto authored
absolute_trust() is now called trust_transitivity(), and the whole trust matrix can now be efficiently calculated.

Tiago Peixoto authored

Tiago Peixoto authored

 03 May, 2010 8 commits


Tiago Peixoto authored

Tiago Peixoto authored

Tiago Peixoto authored
Vectors are used now instead of unordered_sets, which dramatically improves performace.

Tiago Peixoto authored
This fixes a bug where edges were left unindexed.

Tiago Peixoto authored

Tiago Peixoto authored

Tiago Peixoto authored

Tiago Peixoto authored
This also maintains compatibility with older boost versions.

 07 Mar, 2010 2 commits


Tiago Peixoto authored

Tiago Peixoto authored

 21 Feb, 2010 1 commit


Tiago Peixoto authored

 20 Feb, 2010 7 commits


Tiago Peixoto authored

Tiago Peixoto authored

Tiago Peixoto authored

Tiago Peixoto authored
This fixes the expected values for several doctests, after random_graph() refactoring.

Tiago Peixoto authored
Now the degree sequence is verified with ErdösGallai inequalities, and the edges are connected in a deterministic fashion. The edges then are rewired with the random_rewire() function.

Tiago Peixoto authored
This includes also some internal refactoring, and bug fixes.

Tiago Peixoto authored
This extensively modifies the random_rewire() algorithm, so that only either the source or the edge of each edge is rewired (not both, as previously), and no parallel edges are created during the algorithm (if desired). The new version is much faster, and never gets stuck. However, more than one run may be necessary in order to obtain a uniform shuffling.

 14 Feb, 2010 1 commit


Tiago Peixoto authored
This fixes a implicit directionality bug in random_rewire() with undirected graphs.

 08 Feb, 2010 1 commit


Tiago Peixoto authored
This fixes a problem, where the underlying edge directionality would cause correlations to arise when rewiring undirected graphs. Now each edge is correctly considered in both possible orientations, which are chosen randomly.

 04 Feb, 2010 1 commit


Tiago Peixoto authored
This implements a shortest_path() function which returns the shortest path between two vertices. This also modifies shortest_distances, such that a predecessor map is optionally returned.
