# igraph.undocumented

From igraph v0.6.5-2
by Gabor Csardi

##### Undocumented and unsupportted igraph functions

These functions are still in the alpha stage or their arguments are expected to change, so they're not documented yet. They are also not very useful for the general audience.

- Keywords
- graphs

##### Usage

```
lastcit.game(n, edges=1, agebins=n/7100, pref=(1:(agebins+1))^-3,
directed=TRUE)
cited.type.game(n, edges=1, types=rep(0, n),
pref=rep(1, length(types)),
directed=TRUE, attr=TRUE)
citing.cited.type.game(n, edges=1, types=rep(0, n),
pref=matrix(1, nrow=length(types), ncol=length(types)),
directed=TRUE, attr=TRUE)
```

##### Arguments

- n
- Number of vertices.
- edges
- Number of edges per step.
- agebins
- Number of aging bins.
- pref
- Vector (
`lastcit.game`

and`cited.type.game`

or matrix (`citing.cited.type.game`

) giving the (unnormalized) citation probabilities for the different vertex types. - directed
- Logical scalar, whether to generate directed networks.
- types
- Vector of length
, the types of the vertices. Types are numbered from zero.`n`

- attr
- Logical scalar, whether to add the vertex types to the
generated graph as a vertex attribute called
.`type`

##### Value

- A new graph.

*Documentation reproduced from package igraph, version 0.6.5-2, License: GPL (>= 2)*

### Community examples

Looks like there are no examples yet.