class_docstr: A directed graph where edges are one-way (a two-way edge can be represented by using two edges).
docstr: Create a new graph where every edge a->b is replaced with an edge b->a
docstr_tok: ["Create","a","new","graph","where","every","edge","a-",">","b","is","replaced","with","an","edge","b-",">","a"]
code: def reverse_graph(self):
      """
      Create a new graph where every edge a->b is replaced with an edge b->a
      """
      reverse_graph = Graph(self.vertex_count)
      for source, adjacent in self.graph.items():
          for target in adjacent:
              # Note: we reverse the order of arguments
              # pylint: disable=arguments-out-of-order
              reverse_graph.add_edge(target, source)
      return reverse_graph
  
file_path: keon-algos/algorithms/graph/check_digraph_strongly_connected.py
imports: from collections import defaultdict
label_desc: Use image node_id 5 for calling the Graph obj's underlying member method code with example usage: obj.reverse_graph() and returns: reverse_graph