graphGenerator             package:RBGL             R Documentation

_G_e_n_e_r_a_t_e _a_n _u_n_d_i_r_e_c_t_e_d _g_r_a_p_h _w_i_t_h _a_d_j_u_s_t_a_b_l_e _c_l_u_s_t_e_r_i_n_g _c_o_e_f_f_i_c_i_e_n_t

_D_e_s_c_r_i_p_t_i_o_n:

     Generate an undirected graph with adjustable clustering
     coefficient

_U_s_a_g_e:

     graphGenerator(n, d, o)

_A_r_g_u_m_e_n_t_s:

       n: no. of nodes in the generated graph

       d: parameter for preferential attachment

       o: parameter for triple generation

_D_e_t_a_i_l_s:

     The graph generator works according to the prefential attachment
     rule.  It also generates graphs with adjustable clustering
     coefficient.  Parameter 'd' specifies how many preferred edges a
     new node has.  Parameter 'o' limits how many triples to add to a
     new node.

     See reference for details.

_V_a_l_u_e:

no. of nodes: No. of nodes in the generated graph

no. of edges: No. of edges in the generated graph

   edges: Edges in the generated graph

_A_u_t_h_o_r(_s):

     Li Long <li.long@isb-sib.ch>

_R_e_f_e_r_e_n_c_e_s:

     Approximating Clustering Coefficient and Transitivity, T. Schank,
     D. Wagner,  Journal of Graph Algorithms and Applications, Vol. 9,
     No. 2 (2005).

_S_e_e _A_l_s_o:

     clusteringCoef, transitivity, clusteringCoefAppr

_E_x_a_m_p_l_e_s:

     n <- 20
     d <- 6
     o <- 3
     gg <- graphGenerator(n, d, o)

