[Networkit] New Features: BFS/DFS Iterators, PageRank, EigenvectorCentrality, RmatGenerator

Staudt, Christian (ITI) christian.staudt at kit.edu
Thu Apr 3 13:54:38 CEST 2014

The following new features are now available in the Dev branch and will be included in the upcoming NetworKit 3.1 release:

1) BFS/DFS iterators on the C++ level

Graph::BFSfrom(node, handle)
Graph::DFSfrom(node, handle)

2) PageRank

centrality.PageRank: PageRank as node centrality measure.

3) Eigenvector Centrality

	Computes the leading eigenvector of the graph's adjacency matrix (normalized in 2-norm).
 	Interpreted as eigenvector centrality score.

4) R-MAT Generator:

	  Generates static R-MAT graphs. R-MAT (recursive matrix) graphs are
	  random graphs with n=2^scale nodes and m=nedgeFactor edges.
	  More details at http://www.graph500.org or in the original paper:
	  Deepayan Chakrabarti, Yiping Zhan, Christos Faloutsos:
	  R-MAT: A Recursive Model for Graph Mining. SDM 2004: 442-446.

Kind regards

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/20140403/75d9a7dd/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/20140403/75d9a7dd/attachment.sig>

More information about the NetworKit mailing list