# get.adjlist

From igraph v0.5.3
by Gabor Csardi

##### Adjacency lists

Create adjacency lists from a graph, either for adjacent edges or for neighboring vertices

- Keywords
- graphs

##### Usage

```
get.adjlist(graph, mode = c("all", "out", "in", "total"))
get.adjedgelist(graph, mode = c("all", "out", "in", "total"))
```

##### Arguments

- graph
- The input graph.
- mode
- Character scalar, it gives what kind of adjacent
edges/vertices to include in the lists.
is for outgoing edges/vertices,`out`

is for incoming edges/vertices,`in`

`all`

##### Details

`get.adjlist`

returns a list of numeric vectors, which include
the ids of neighbor vertices (according to the `mode`

argument) of all
vertices.

`get.adjedgelist`

returns a list of numeric vectors, which
include the ids of adjacent edgs (according to the `mode`

argument) of all vertices.

##### Value

- A list of numeric vectors.

##### concept

Adjacency list

##### See Also

##### Examples

```
g <- graph.ring(10)
get.adjlist(g)
get.adjedgelist(g)
```

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

### Community examples

Looks like there are no examples yet.