code: def deepest_common_ancestor(goterms, godag):
      '''
          This function gets the nearest common ancestor
          using the above function.
          Only returns single most specific - assumes unique exists.
      '''
      # Take the element at maximum depth.
      return max(common_parent_go_ids(goterms, godag), key=lambda t: godag[t].depthf deepest_common_ancestor(goterms, godag):
      '''
          This function gets the nearest common ancestor
          using the above function.
          Only returns single most specific - assumes unique exists.
      '''
      # Take the element at maximum depth.
      return max(common_parent_go_ids(goterms, godag), key=lambda t: godag[t].depth)
docs: This function gets the nearest common ancestor
          using the above function.
          Only returns single most specific - assumes unique exists.