Which statement about Directed Graph is correct?

A. after each full pass, an extreme element reaches its final region B. both front and rear operations can be efficient C. an edge from u to v need not imply an edge from v to u D. its main operations are find and union