class_docstr: A directed graph
docstr: Determine if there is a path from source to target using a depth first search.
  :param: visited should be an array of booleans determining if the
  corresponding vertex has been visited already
docstr_tok: ["Determine","if","there","is","a","path","from","source","to","target","using","a","depth","first","search",".",":","param",":","visited","should","be","an","array","of","booleans","determining","if","the","corresponding","vertex","has","been","visited","already"]
code: def dfsutil(self, visited, source, target):
      """
      Determine if there is a path from source to target using a depth first search.
      :param: visited should be an array of booleans determining if the
      corresponding vertex has been visited already
      """
      visited[source] = True
      for i in self.graph[source]:
          if target in self.graph[source]:
              self.has_path = True
              return
          if not visited[i]:
              self.dfsutil(visited, source, i)
  
imports: from collections import defaultdict
label_desc: Use image node_id 4 for calling the Graph obj's underlying member method code with example usage: obj.dfsutil(visited, source, target) without return types