- 02 Aug, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 15 Jul, 2009 2 commits
-
-
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 modified several docstrings and introduces a quick-start guide.
-
- 06 Feb, 2009 1 commit
-
-
Tiago Peixoto authored
The seed option is now correctly interpreted.
-
- 18 Jan, 2009 1 commit
-
-
Tiago Peixoto authored
-
- 26 Oct, 2008 1 commit
-
-
Tiago Peixoto authored
Reduce duplication of code for loading C++ modules.
-
- 21 Jul, 2008 1 commit
-
-
Tiago Peixoto authored
Also, get rid of g.underlying_graph(), and rely on "private" variable g._Graph__graph instead.
-
- 10 Apr, 2008 1 commit
-
-
Tiago Peixoto authored
The whole histogram code has been redone, and the code has been simplified. The three-point vertex-edge-vertex correlation has been scrapped, since it's not frequently used, and would make compilation even more expensive. This also adds some missing files to the generation routine.
-