transpose_graph

(1)
template <class VertexListGraph, class MutableGraph> 
void transpose_graph(const VertexListGraph& G1, MutableGraph& G2);

(2)
template <class VertexListGraph, class MutableGraph, class ID> 
void transpose_graph(const VertexListGraph& G1, MutableGraph& G2, ID id);

Computes the transpose of a directed graph. The transpose of a directed graph G = (V, E)is the graph G_T = (V, E_T) , where E_T = {(v, u) in V x V: (u, v) in E} . i.e., G_T is with all its edges reversed.

Graph G2 passed into the algorithm must have the same number of vertices as G1 and no edges. The edges will be added by transpose_graph() by calling add_edge(G2,u,v).

Where Defined

boost/graph/transpose_graph.hpp

Requirements on Types

• The graph type for argument G1 must be a model of VertexListGraph.
• The graph type for argument G2 must be a model of MutableGraph.

Complexity

The time complexity is O(V + E).