src/main/java/org/thegalactic/dgraph/ConcreteDGraph.java
public void transpose() {
        ConcreteDGraph<N, E> tmp = new ConcreteDGraph<N, E>(this);
        for (Edge<N, E> edge : tmp.getEdges()) {
            this.removeEdge(edge);
            this.addEdge(new Edge(edge.getTarget(), edge.getSource(), edge.getContent()));
        }
    }
/**
     * Transposes this component by replacing for each node its successor set by
     * its predecessor set, and its predecessor set by its successor set.
     */
Transposes this component by replacing for each node its successor set by
its predecessor set, and its predecessor set by its successor set.
Transposes this component by replacing for each node its successor set by its predecessor set and its predecessor set by its successor set .
public void transpose() {
        ConcreteDGraph<N, E> tmp = new ConcreteDGraph<N, E>(this);
        for (Edge<N, E> edge : tmp.getEdges()) {
            this.removeEdge(edge);
            this.addEdge(new Edge(edge.getTarget(), edge.getSource(), edge.getContent()));
        }
    }
public void transpose ( ) { ConcreteDGraph < N , E > tmp = new ConcreteDGraph < N , E > ( this ) ; for ( Edge < N , E > edge : tmp . getEdges ( ) ) { this . removeEdge ( edge ) ; this . addEdge ( new Edge ( edge . getTarget ( ) , edge . getSource ( ) , edge . getContent ( ) ) ) ; } }
Transposes this component by replacing for each node its successor set by
 its predecessor set, and its predecessor set by its successor set.
Transposes this component by replacing for each node its successor set by its predecessor set and its predecessor set by its successor set .