code: def edges_to_path(edges,
                    vertices,
                    **kwargs):
      
      # sequence of ordered traversals
      dfs = graph.traversals(edges, mode='dfs')
      # make sure every consecutive index in DFS
      # traversal is an edge in the source edge list
      dfs_connected = graph.fill_traversals(dfs, edges=edges)
      # kwargs for Path constructor
      # turn traversals into Line objects
      lines = [Line(d) for d in dfs_connected]
  
      kwargs.update({'entities': lines,
                     'vertices': vertices})
      return kwargs
docs: Given an edge list of indices and associated vertices
      representing lines, generate kwargs for a Path object.
  
      Parameters
      -----------
      edges : (n, 2) int
        Vertex indices of line segments
      vertices : (m, dimension) float
        Vertex positions where dimension is 2 or 3
  
      Returns
      ----------
      kwargs: dict, kwargs for Path constructor