code: def _depends(
      graph: DepGraph, visited: Dict[int, bool], tid: int, qid: int
  ) -> List[int]:
      """Whether there is a dependency path from module tid to module qid.
  
      Given graph, and without going through visited.
      """
      if tid not in graph.edges or qid not in graph.edges:
          return []
      if qid in graph.edges[tid]:
          # tid directly depends on qid.
          return [tid, qid]
      for c in graph.edges[tid]:
          if c in visited:
              continue
          visited[c] = True
          # Reduce to a question of whether there is a path from c to qid.
          ds = _depends(graph, visited, c, qid)
          if ds:
              # From tid -> c -> qid.
              return [tid] + ds
      return []
  
imports: import argparse
  import ast
  import os
  import re
  import subprocess
  import sys
  from typing import Dict, List, Tuple
label_desc: Use image node_id 13 for calling a global function with example usage: _depends(graph, visited, tid, qid) and returns: list, list, list, unknown