Vertex

Node

Data Structor & Fields:

• An int key which represents the uniq key of the vertex.
• An int random_key which represents the uniq key of the vertex in case a key has not been iserted.
• A tuple pos which represents the position of the vertex.
• An int tag to be used freely.
• A NodeData pred which represents predecessor (father) node.
• An int num_of_ed_in which represents all of the edges coming in the vertex.
• An int num_of_ed_out which represents all of the edges coming out of the vertex.

Functions:

• A regular init function.
• Getter and setters to all fields.
• str function which allows to get a String representing the vertex.
• repr function which allows to get a representing of the vertex.
• An encoder which allows to get a representing of the vertex in a json format.
• lt function which allows to tell which vertex is bigger according to their tag. Will be used later in a priority queue.
• eq function which returns true iff the two vertices are equals by all fields.