- 06 Nov, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 05 Nov, 2009 7 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
Since the same edge appears twice in Vertex.all_edges() if it is a self_loop, it would be deleted twice in Graph.clear_vertex(), raising an exception. Now, the edges are stored in a set first, avoiding this problem.
-
Tiago Peixoto authored
Small fixes of some examples in the docstrings.
-
Tiago Peixoto authored
This fixes a crash when a "valid" copy of an invalid edge descriptor is removed from the graph. Now the invalidity of the descriptor is detected and exposed.
-
Tiago Peixoto authored
This fixes the problem of generating invalid Makefiles when more than one python installation is found.
-
Tiago Peixoto authored
Use the original, simpler, path weight calculation.
-
Tiago Peixoto authored
Fix compilation warnings with boost 1.40, remove unnecessary files, fix autoconf macros and link with "boost_graph". This also raises the minimum boost version to 1.40.
-
- 04 Nov, 2009 1 commit
-
-
Tiago Peixoto authored
This includes the shortest_distance() function in the topology module.
-
- 23 Oct, 2009 5 commits
-
-
Tiago Peixoto authored
This is a workaround for strange entries in sys.path; either dirs that don't exist, or are in unicode.
-
Tiago Peixoto authored
Properties with empty values are now simply not printed in the output.
-
Tiago Peixoto authored
Some property typles wrongly included the index map, when they shouldn't.
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 17 Oct, 2009 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 12 Oct, 2009 1 commit
-
-
Tiago Peixoto authored
This fixes how paths are weighted in the absolute_trust algorithm.
-
- 09 Oct, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 05 Oct, 2009 6 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
This completes all the documentation up to this point.
-
- 03 Oct, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 18 Sep, 2009 4 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
This dumps the random-path approach, and implements a deterministic, priority queue algorithm.
-
Tiago Peixoto authored
This fixes an obvious problem, where the graph gets deleted, and the descriptors are still lying around. Usage of orphaned descriptors will now just raise a ValueError. The __repr__ function of Edge, Vertex, and PropertyMap now give something more informative about each object.
-
- 12 Sep, 2009 1 commit
-
-
Tiago Peixoto authored
In both functions we can save some time by hashing the subgraphs found, according to their degree distribution signature (instead of number of edges). This avoids a large number of useless exactness or isomorphism comparisons. This also removes the "seed" parameter, which is redundant to the numpy.random.seed() function.
-
- 07 Sep, 2009 1 commit
-
-
Tiago Peixoto authored
Mostly in the flow and spectral modules.
-
- 06 Sep, 2009 7 commits
-
-
Tiago Peixoto authored
The file graph_predecessor.hh was missing.
-
Tiago Peixoto authored
The value "random" should be "uncorrelated" instead.
-
Tiago Peixoto authored
-
Tiago Peixoto authored
Call to random() must be protected by "omp critical".
-
Tiago Peixoto authored
This returns the union of two graphs, and optionally specified property maps.
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 05 Sep, 2009 1 commit
-
-
Tiago Peixoto authored
-