code: def remove_edge_fun(graph):
      
  
      # Namespace shortcut for speed.
      rm_edge, rm_node = graph.remove_edge, graph.remove_node
      from networkx import is_isolate
  
      def remove_edge(u, v):
          rm_edge(u, v)  # Remove the edge.
          if is_isolate(graph, v):  # Check if v is isolate.
              rm_node(v)  # Remove the isolate out node.
  
      return remove_edge
docs: Returns a function that removes an edge from the `graph`.
  
      ..note:: The out node is removed if this is isolate.
  
      :param graph:
          A directed graph.
      :type graph: networkx.classes.digraph.DiGraph
  
      :return:
          A function that remove an edge from the `graph`.
      :rtype: callable