# reverse_edges: Reverse edges in a graph In igraph: Network Analysis and Visualization

 reverse_edges R Documentation

## Reverse edges in a graph

### Description

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.

### Usage

``````reverse_edges(graph, eids = E(graph))

## S3 method for class 'igraph'
t(x)
``````

### Arguments

 `graph` The input graph. `eids` The edge IDs of the edges to reverse. `x` The input graph.

### Value

The result graph where the direction of the edges with the given IDs are reversed

Other functions for manipulating graph structure: `+.igraph()`, `add_edges()`, `add_vertices()`, `complementer()`, `compose()`, `connect()`, `contract()`, `delete_edges()`, `delete_vertices()`, `difference.igraph()`, `difference()`, `disjoint_union()`, `edge()`, `igraph-minus`, `intersection.igraph()`, `intersection()`, `path()`, `permute()`, `rep.igraph()`, `simplify()`, `union.igraph()`, `union()`, `vertex()`

Other functions for manipulating graph structure: `+.igraph()`, `add_edges()`, `add_vertices()`, `complementer()`, `compose()`, `connect()`, `contract()`, `delete_edges()`, `delete_vertices()`, `difference.igraph()`, `difference()`, `disjoint_union()`, `edge()`, `igraph-minus`, `intersection.igraph()`, `intersection()`, `path()`, `permute()`, `rep.igraph()`, `simplify()`, `union.igraph()`, `union()`, `vertex()`

### Examples

``````
g <- make_graph(~ 1 -+ 2, 2 -+ 3, 3 -+ 4)
reverse_edges(g, 2)
``````

igraph documentation built on Aug. 10, 2023, 9:08 a.m.