I need to do this problem for an assignment. We have not focused very much on this topc and that would be great if someone could help me get started. I am not asking for a complete solution or anything, just to head me in the right direction. The problem is:
Use edge lists to reimplement the graph class from the figure below. There should be no limit to the number of vertices. Alternatively, you could reimplment the graph class so that each vertex has a set of egges (using the set class from the Standard Library).
(in these urls)