class_docstr: A connected graph of Vertex/Edge objects. A GraphBase is a *component* of a Graph that contains a connected set of Vertex and Edges.
  
  Attributes:
      verticesPoset (Poset[Vertex]): the partially ordered set of vertices of the graph.
      edgesPoset (Poset[Edge]): the partially ordered set of edges of the graph.
      loops (set[Edge]): the set of *loop* edges (of degree 0).
      directed (bool): indicates if the graph is considered *oriented* or not.
class_docstr_tok: ["A","connected","graph","of","Vertex\/Edge","objects",".","A","GraphBase","is","a","*","component","*","of","a","Graph","that","contains","a","connected","set","of","Vertex","and","Edges",".","Attributes",":","verticesPoset","(","Poset","[","Vertex","]",")",":","the","partially","ordered","set","of","vertices","of","the","graph",".","edgesPoset","(","Poset","[","Edge","]",")",":","the","partially","ordered","set","of","edges","of","the","graph",".","loops","(","set","[","Edge","]",")",":","the","set","of","*","loop","*","edges","(","of","degree","0",")",".","directed","(","bool",")",":","indicates","if","the","graph","is","considered","*","oriented","*","or","not","."]
code: def dft(self, start_vertex=None):
      result = []
  
      if start_vertex is None:
          start_vertex = next(self.vertices())
  
      def recursive_helper(node):
          result.append(node)
          children = [e.v[1] for e in node.e_out()]
          for child in children:
              if child not in result:
                  recursive_helper(child)
  
      recursive_helper(start_vertex)
      return result
  
imports: from graphistry.layout.utils import Poset
label_desc: Use image node_id 31 for calling the GraphBase obj's underlying member method code with example usage: obj.dft(start_vertex) and returns: result