Reverse edges in a graph

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.

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

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()

Related documentation in the C library

reverse_edges().

Examples

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