Find all vertices in a graph G that can be reached using a patterned walk

Question

If I am given a directed graph G with pre-colored edges and a color pattern to traverse, via walk, through the directed graph. How would I go about finding all the vertices