[boost] Topological Embedding of Graphs?

Hi, I'm a new user to the Boost library in general, and I was wondering if the following feature is built into the BGL. When dealing with graphs with an embedding, one can encode the embedding by giving a cyclic ordering of adjacent vertices, for each vertex. I've looked at the adjacency_list's documentation, and after a few tests, I discovered that such cyclic ordering is not guaranteed. How can one go about doing this? I can set up the input so that the edge list is given in that order. Any help would be much appreciated. Thanks! --Ethan