Graph package clients: trip and make. Trip requires one to implement A* algorithm to find the shortest from a point to another point in a graph. Make requires one to implement depth-first and breadth-first traversal efficiently.