Data Abstract Structures in Java. I'm building an Graph.java class and trying to implement addDirectedEdge/addUndirectedEdge methods. I have a List.java class that has:

List.java class methods for insert: addFirst(insert front of list) addLast(insert end of list) addIterator(insert to current node) global variable: - ArrayList> adj; Question: Need help implementing, but not sure which insert method to call also.

/xok Inserts vertex v into the adjacency list of vertexu * (i.e. inserts v into the list at index u) k @precondition, 0