gerryjenkinslb

# Undirected Graph ADT with edge data stored as adj_vertices dict for each Vertex
# The key to each edge is a nomalized tuple of the vertex ids ordered from low to high
# edge id (eid) for v1, v2  is (v1,v2) or (v2,v1) such that the first tuple item is less than second


def edge_id(v1,v2):  # normalize key v1,v2 to tuple (v_low,v_hi)
    return (v1, v2) if v1 <= v2 else (v2, v1)

class Vertex(object):

WetHat