 Windmill graphs are trivially perfect.describes a simple linear time algorithm for recognizing trivially perfect graphs, based on lexicographic breadth-first search.Whenever the LexBFS algorithm removes a vertex "v" from the first set on its queue, the algorithm checks that all remaining neighbors of "v" belong to the same set; if not, one of the forbidden induced subgraphs can be constructed from "v".