- 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() re-factoring.
-
Tiago Peixoto authored
Now the degree sequence is verified with Erdös-Gallai 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 2 commits
-
-
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.
-
Tiago Peixoto authored
This fixes a crash when purging filtered vertices.
-
- 30 Jan, 2010 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 29 Jan, 2010 1 commit
-
-
Tiago Peixoto authored
-
- 28 Jan, 2010 5 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
Support for edge/vertex labelling is 99% done, but it is currently impractical to compile with GCC. If GCC 4.5 doesn't do a better job, then a workaround would be necessary.
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 25 Jan, 2010 2 commits
-
-
Tiago Peixoto authored
This also cleans up some m4 boost macros, and includes other small corrections to configure.ac.
-
Tiago Peixoto authored
-
- 12 Jan, 2010 1 commit
-
-
Tiago Peixoto authored
-
- 10 Jan, 2010 1 commit
-
-
Tiago Peixoto authored
-
- 30 Dec, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 23 Dec, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-