import graph
class Graph(Set) def __init__(self, name = 'Graph') string __module__ = 'graph' def clear_tags(self) def get_dfs_path(self, object1, object2) def insert(self, object) def insert_edge(self, object1, label, object2) # Methods inherited by Graph from Object def __cmp__(self, object) def __hash__(self) def __str__(self) def copy(self) def read(self, filename) def write(self, filename) # Methods inherited by Graph from Map def __add__(self, map) def __delitem__(self, key) def __getitem__(self, key) def __len__(self) def __setitem__(self, key, value) def add(self, map) def clear(self) def has_key(self, key) def insert_map(self, map) def items(self) def keys(self) def values(self) # Methods inherited by Graph from Set def __repr__(self) def insert_set(self, set)
Non commutative addition. A new map is created
do not overload, should be equivalent to self.name
return a vertex
serialization
serialization