graphs the and vertex attributes are not required in any graph representationbut to draw graph it is nice to have location information for the vertices all this information is stored in the xml filebut what about the three algorithms presented in this what information is actually needed by each algorithm when searching graph by depth first search vertices are pushed onto stack as the search proceeds in that case the vertex information must be stored for use by the search in this casesince edges have the vertexid of their edge endpointsit would be nice to have method to quickly lookup vertices within the graph map or dictionary from vertexid to vertices would be convenient it makes sense to create class to hold the vertex information like the class definition of sect vertex class class vertexdef __init__(self,vertexid, , ,label)self vertexid vertexid self self self label label self adjacent [self previous none in this vertex class definition for directed graphs it makes sense to store the edges with the vertex since edges connect vertices the adjacent list can hold the list of adjacent vertices when running depth first search map of vertexid to vertex for each of the vertices in the graph provides the needed information for the algorithm when implementing kruskal' algorithma list of edges is the important feature of the graph the class definition of sect provides less-than method which allows edge objects to be sortedwhich is crucial for kruskal' algorithm the vertices themselves are not needed by the algorithm list of edges and the partition data structure suffice for running kruskal' algorithm this copy belongs to 'acha