implementation of graph edge in python/
#edge object for graphs
class Edge(object):
def __init__(self, enter, exit, directed=False):
self.enter = enter
self.exit = exit
self.directed = directed
def __repr__(self):
if self.directed:
return str(self.enter) + "->" + str(self.exit)
else:
return str(self.enter) + "--" + str(self.exit)
def path(self, node):
if self.directed:
if node == self.enter:
return self.exit
elif node == self.exit:
return False
else:
raise ValueError("Node not found")
else:
if node == self.enter:
return self.exit
elif node == self.exit:
return self.enter
else:
raise ValueError("Node not found")