[graph-tool] Functions producing small-world / scale free / ER networks

Hi all, I would like to know if somebody has already coded functions for creating some small-world / scale free / ER networks with the following parameters (similar to networkx): small-world -> n : The number of nodes , k : Each node is connected to k nearest neighbors in ring topology , p: The probability of rewiring each edge scale-free -> n : Number of nodes, m : Number of edges to attach from a new node to existing nodes ER -> n : The number of nodes , p : Probability for edge creation. Cheers! Mehdi -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/... Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com.