Create a tree that is structured so that if algorithms were run on it, breadth first search would be faster than depth first search and that uniform cost search would be faster than breadth first search.