The new graph will contain the same vertices, edges and attributes as
the original graph, except that the direction of the edges selected by
their edge IDs in the `eids`

argument will be reversed. When reversing
all edges, this operation is also known as graph transpose.

## See also

Other functions for manipulating graph structure:
`+.igraph()`

,
`add_edges()`

,
`add_vertices()`

,
`complementer()`

,
`compose()`

,
`connect()`

,
`contract()`

,
`delete_edges()`

,
`delete_vertices()`

,
`difference()`

,
`difference.igraph()`

,
`disjoint_union()`

,
`edge()`

,
`igraph-minus`

,
`intersection()`

,
`intersection.igraph()`

,
`path()`

,
`permute()`

,
`rep.igraph()`

,
`simplify()`

,
`union()`

,
`union.igraph()`

,
`vertex()`

## Examples

```
g <- make_graph(~ 1 -+ 2, 2 -+ 3, 3 -+ 4)
reverse_edges(g, 2)
#> IGRAPH 664115a DN-- 4 3 --
#> + attr: name (v/c)
#> + edges from 664115a (vertex names):
#> [1] 1->2 3->2 3->4
```