\HeaderA{graphGenerator}{Generate an undirected graph with adjustable clustering coefficient}{graphGenerator}
\keyword{models}{graphGenerator}
\begin{Description}\relax
Generate an undirected graph with adjustable clustering coefficient
\end{Description}
\begin{Usage}
\begin{verbatim}
graphGenerator(n, d, o)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{n}] no. of nodes in the generated graph
\item[\code{d}] parameter for preferential attachment
\item[\code{o}] parameter for triple generation
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
The graph generator works according to the prefential attachment rule.  It also generates graphs with adjustable clustering coefficient.  Parameter \code{d} specifies how many preferred edges a new node has.  Parameter \code{o} limits how many triples to add to a new node.

See reference for details.
\end{Details}
\begin{Value}
\begin{ldescription}
\item[\code{no. of nodes}] No. of nodes in the generated graph
\item[\code{no. of edges}] No. of edges in the generated graph
\item[\code{edges}] Edges in the generated graph
\end{ldescription}
\end{Value}
\begin{Author}\relax
Li Long <li.long@isb-sib.ch>
\end{Author}
\begin{References}\relax
Approximating Clustering Coefficient and Transitivity, T. Schank, D. Wagner, 
Journal of Graph Algorithms and Applications, Vol. 9, No. 2 (2005).
\end{References}
\begin{SeeAlso}\relax
clusteringCoef, transitivity, clusteringCoefAppr
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
n <- 20
d <- 6
o <- 3
gg <- graphGenerator(n, d, o)
\end{ExampleCode}
\end{Examples}

