# Graphs from adjacency lists

From igraph v0.6.5-2
by Gabor Csardi

##### Create graphs from adjacency lists

An adjacency list is a list of numeric vectors, containing the neighbor vertices for each vertex. This function creates an igraph graph object from such a list.

- Keywords
- graphs

##### Usage

```
graph.adjlist(adjlist, mode = c("out", "in", "all", "total"),
duplicate = TRUE)
```

##### Arguments

- adjlist
- The adjacency list. It should be consistent, i.e. the maximum throughout all vectors in the list must be less than the number of vectors (=the number of vertices in the graph). Note that the list is expected to be 0-indexed.
- mode
- Character scalar, it specifies whether the graph to create
is undirected (
all ortotal ) or directed; and in the latter case, whether it contains the outgoing (out ) or the incoming (in< - duplicate
- Logical scalar. For undirected graphs it gives
whether edges are included in the list twice. E.g. if it is
`TRUE`

then for an undirected`{A,B}`

edge`graph.adjlist`

expects`A`

included in the neigh

##### Details

Adjacency lists are handy if you intend to do many (small) modifications to a graph. In this case adjacency lists are more efficient than igraph graphs.

The idea is that you convert your graph to an adjacency list by
`get.adjlist`

, do your modifications to the graphs and
finally create again an igraph graph by calling `graph.adjlist`

.

##### Value

- An igraph graph object.

##### See Also

##### Examples

```
## Directed
g <- graph.ring(10, dir=TRUE)
al <- get.adjlist(g, mode="out")
g2 <- graph.adjlist(al)
graph.isomorphic(g, g2)
## Undirected
g <- graph.ring(10)
al <- get.adjlist(g)
g2 <- graph.adjlist(al, mode="all")
graph.isomorphic(g, g2)
ecount(g2)
g3 <- graph.adjlist(al, mode="all", duplicate=FALSE)
ecount(g3)
is.multiple(g3)
```

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

### Community examples

Looks like there are no examples yet.