I am a newbie to the graph library. I have a directed graph, and given a vertex_descriptor, I would like to access its parents. It is sort of an adjacency_iterator in reverse I believe. Is there such a thing, or do i have to derive it from and existing iterator...? Thanks, Matt