Transcript from the "Exercise: Implement a Graph" Lesson
>> Bianca Gandolfo: Exercise time. We are going to implement a graph, so let's go into this really quick, and I'll tell you which ones.
>> Bianca Gandolfo: So let's see.
>> Bianca Gandolfo: Blah, blah, blah.
>> Bianca Gandolfo: Let's do addNode. Let's do addNode, contains, and addEdge.
>> Bianca Gandolfo: So do everything except for removals and traversing.
>> Bianca Gandolfo: So we want to check for edges, addEdges, and no looping. So no for each. So hasEdge, addEdge, contains, addNode. Does that make sense? No traversing, no removal.