code: def group_out_degree_centrality(G, S):
      """Compute the group out-degree centrality for a group of nodes.
  
      Group out-degree centrality of a group of nodes $S$ is the fraction
      of non-group members connected to group members by outgoing edges.
  
      Parameters
      ----------
      G : graph
         A NetworkX graph.
  
      S : list or set
         S is a group of nodes which belong to G, for which group in-degree
         centrality is to be calculated.
  
      Returns
      -------
      centrality : float
         Group out-degree centrality of the group S.
  
      Raises
      ------
      NetworkXNotImplemented
         If G is undirected.
  
      NodeNotFound
         If node(s) in S are not in G.
  
      See Also
      --------
      degree_centrality
      group_degree_centrality
      group_in_degree_centrality
  
      Notes
      -----
      The number of nodes in the group must be a maximum of n - 1 where `n`
      is the total number of nodes in the graph.
  
      `G.neighbors(i)` gives nodes with an outward edge from i, in a DiGraph,
      so for group out-degree centrality, the graph itself is used.
      """
      return group_degree_centrality(G, S)
  
file_path: networkx/networkx/algorithms/centrality/group.py
imports: from copy import deepcopy
  import networkx
  from networkx.algorithms.centrality.betweenness import _accumulate_endpoints, _single_source_dijkstra_path_basic, _single_source_shortest_path_basic
  from networkx.utils.decorators import not_implemented_for
label_desc: Use image node_id 9 for calling a global function with example usage: group_out_degree_centrality(G, S) and returns: group_degree_centrality