class_docstr:  A graph edge.
  
  **Attributes**
    - data (object): an optional payload
    - w (int): an optional weight associated with the edge (default 1) used by Dijkstra to find min-flow paths.
    - feedback (bool):  whether the Tarjan algorithm has inverted this edge to de-cycle the graph.
class_docstr_tok: ["A","graph","edge",".","*","*","Attributes","*","*","-","data","(","object",")",":","an","optional","payload","-","w","(","int",")",":","an","optional","weight","associated","with","the","edge","(","default","1",")","used","by","Dijkstra","to","find","min-flow","paths",".","-","feedback","(","bool",")",":","whether","the","Tarjan","algorithm","has","inverted","this","edge","to","de-cycle","the","graph","."]
code: def __lt__(self, v):
      return 0
  
file_path: pygraphistry/graphistry/layout/graph/edge.py
imports: from .edgeBase import EdgeBase
label_desc: Use image node_id 4 for calling the Edge obj's underlying member method code with example usage: obj.__lt__(v) and returns: int