- 23 Oct, 2008 2 commits
-
-
Tiago Peixoto authored
Unnecessary dynamic polymorphism is replaced by static polymorphism, in the definitions of the rewiring strategies.
-
Tiago Peixoto authored
This also creates the misc sub-module. This may be re-organized in the future.
-
- 21 Oct, 2008 2 commits
-
-
Tiago Peixoto authored
Restructure the rewiring code, introducing further abstraction through class inheritance. Both uncorrelated and correlated cases draw edges directly. This has actually proven faster than drawing vertices for the correlated case, since realizing that indexes could be stored instead of edges. Doing so avoids changes in the pool of candidate edges, which in turn removes the need to rebuild it for each edge to rewire. Consequently, it also makes the uncorrelated case a lot quicker. In the uncorrelated undirected case, the new code also fixes a serious bug: when building the edge pool, only one end of each edge was looked at, because the "edges" vector is not equivalent to drawing all out_edges from all vertices, as is done now.
-
Tiago Peixoto authored
-
- 20 Oct, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 13 Oct, 2008 2 commits
-
-
Tiago Peixoto authored
This contains at the moment functions to perform basic vertex and edge searches.
-
Tiago Peixoto authored
This allows specifying where numpy and scipy are installed, which can be useful when installing graph_tool in a different location.
-
- 10 Oct, 2008 2 commits
-
-
Tiago Peixoto authored
This adds missing uint64_t type to the list o supported numpy types.
-
Tiago Peixoto authored
-
- 07 Oct, 2008 3 commits
-
-
Tiago Peixoto authored
This allows to import all submodules from graph_tool with one command, e.g., from graph_tool.all import *
-
Tiago Peixoto authored
Add $(srcdir) to include paths in AM_CPPFLAGS so that we can compile the program writing all targets into a directory separate from the sources. This is done simply by creatig a subdirectory of the project root and running "../configure" and "make" inside it.
-
Tiago Peixoto authored
This is a re-implementation based on new histogram code, which does not build a 2D histogram, and is thus more exact and uses less memory.
-
- 24 Sep, 2008 3 commits
-
-
Tiago Peixoto authored
This fixes a rather central bug, which causes duplicated indexes if edges are removed and then new ones are added. Edge indexes are now recycled as they are removed and then new ones are added. This still guarantees O(1) complexity when adding or removing edges.
-
Tiago Peixoto authored
Simplify autogen.sh and remove ltmain.sh from repository, which should be included as necessary from libtoolize.
-
Tiago Peixoto authored
Avoids having to do g = Graph() g.load("foo") each time. Now one can do simply, g = load_graph("foo") Fantastic.
-
- 19 Sep, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 10 Sep, 2008 3 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
- 15 Aug, 2008 1 commit
-
-
Tiago Peixoto authored
Use weakrefs to keep track of known property maps in graphs, and owner graphs in property maps to avoid circular references, which may lead to memory leaks. This also fixes a vertex removal bug.
-
- 10 Aug, 2008 1 commit
-
-
Tiago Peixoto authored
This adds a graph_draw() functions which draws graphs in variety of layouts and formats, and also to the screen, using the python graphviz bindings.
-
- 27 Jul, 2008 1 commit
-
-
Tiago Peixoto authored
Fix possible deadlock condition in random graph generation with no_parallel and/or no_self_loops.
-
- 22 Jul, 2008 2 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
Graphs are now exactly copied, including filter state and filter property maps.
-
- 21 Jul, 2008 3 commits
-
-
Tiago Peixoto authored
Use tr1::tuple instead of boost::tuple to get around maximum tuple size limit (this requires GCC 4.3). Introduce get_prop<> template function to facilitate access of property maps from inline C++ code.
-
Tiago Peixoto authored
-
Tiago Peixoto authored
Also, get rid of g.underlying_graph(), and rely on "private" variable g._Graph__graph instead.
-
- 20 Jul, 2008 1 commit
-
-
Tiago Peixoto authored
Betweenness centrality should be differently normalized for undirected and directed graphs, i.e., (n-2)*(n-1)/2 vs. (n-2)*(n-1), respectively. Also, edge centrality should be respectively normalized with n*(n-1)/2 and n*(n-1).
-
- 15 Jul, 2008 5 commits
-
-
Tiago Peixoto authored
-
Tiago Peixoto authored
-
Tiago Peixoto authored
No longer functional or relevant.
-
Tiago Peixoto authored
A new 'clustering' sub-module was created.
-
Tiago Peixoto authored
-
- 17 Jun, 2008 2 commits
-
-
Tiago Peixoto authored
This commit removes the internal property maps from the GraphInterface class, and makes all property maps external by default. The internal property maps were moved to the python layer.
-
Tiago Peixoto authored
This is to avoid a common error of not being able to correctly normalize a histogram because of truncated integer division.
-
- 01 Jun, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 30 May, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 19 May, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 12 May, 2008 1 commit
-
-
Tiago Peixoto authored
-
- 09 May, 2008 1 commit
-
-
Tiago Peixoto authored
-