public Digraph Reverse()
{
var reverse = new Digraph(Vertices);
for (int v = 0; v < Vertices; v++)
{
foreach (var w in adj[v])
{
reverse.AddEdge(w, v);
}
}
return(reverse);
}
public Digraph Reverse()
{
var reverse = new Digraph(Vertices);
for (int tailVertex = 0; tailVertex < Vertices; tailVertex++)
{
foreach (var headVertex in adjacencyList[tailVertex])
{
reverse.AddEdge(headVertex, tailVertex);
}
}
return(reverse);
}
public Digraph Reverse()
{
Digraph digraph = new Digraph(this.VerticesCount);
for (int i = 0; i < this.VerticesCount; i++)
{
foreach (Int32 adjacentVertice in this.GetAdjacentVertices(i))
{
digraph.AddEdge(adjacentVertice, i);
}
}
return(digraph);
}
