You will NOT be asked to implement any graph algorithms - only run them

Traversals - what is the order in which nodes are visited using DFS or BFS?
Algorithms - Dijkstra's shortest path and Ford-Fulkerson max-flow
Representation - given a set of vertices and edges, draw the graph. What are the two edge representations, and how do you decide between them?