[BGL] Common children for vertices in DAG

Is there a fast way, with or without preprocessing of the graph, for checking if two non-adjacent vertices in a DAG have one or more common children? Any pointers to components of the BGL that implement, or can be used to implement, this task would be much appreciated. Thanks, Erik