[Networkit] Feature added: Efficient Erdös-Renyi Generator

Christian Staudt christian.staudt at kit.edu
Wed Jan 22 11:00:48 CET 2014

	  Creates random graphs in the G(n,p) model.
	  The generation follows Vladimir Batagelj and Ulrik Brandes: "Efficient
	  generation of large random networks", Phys Rev E 71, 036113 (2005).
	  - nNodes Number of nodes n in the graph.
	  - prob Probability of existence for each edge p.

C++:   NetworKit::ErdosRenyiGenerator in generators/ErdosRenyiGenerator.h
Python: generators.ErdosRenyiGenerator
Usage: G = generators.ErdosRenyiGenerator(n, p).generate()

Christian Staudt

christian.staudt at kit.edu
Institut of Theoretical Computer Science - Parallel Computing Group 
Building 50.34 Room 249
Karlsruhe Institute of Technology (KIT)

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.ira.uni-karlsruhe.de/mailman/private/networkit/attachments/20140122/d04b8138/attachment.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 495 bytes
Desc: Message signed with OpenPGP using GPGMail
URL: <https://lists.ira.uni-karlsruhe.de/mailman/private/networkit/attachments/20140122/d04b8138/attachment.sig>

More information about the NetworKit mailing list