[NEW ALGORITHM] Reverse a Directed Graph

[shuvojitss]

Name:

[NEW ALGORITHM] Graph reversal algorithm.
Suppose we have a directed graph, we have to find its reverse so if an edge goes from u to v, it now goes from v to u. Here input will be an adjacency list, and if there are n nodes, the nodes will be (0, 1, ..., n-1).

---

If the Input is like this:

The output should be this:

---

About:

This is a major implementation of graph data structure.

---

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it

Additional Information:

Please assign me this issue, I want to work on it.

[pankaj-bind]

assigned