Re: [Boost-users] [Graph] Guarantee on bidirectional graphs

From: >Sensei ... So, is the order of nodes in an edge guaranteed to generate the correct in/out adjacent nodes? I do not care about ordering of nodes, just distinguishing nodes that belong to in and out edges.

For instance, ... std::cout << neighbors_out.first->idx << std::endl; ... std::cout << neighbors_in.first->idx << std::endl;

I am not familiar with the idx member for edge descriptors. But, since you are interested in the target/source of the edge, would it be better to write the following? std::cout << boost::target(*neighbors_out.first, graph) << std::endl; std::cout << boost::source(*neighbors_in.first, graph) << std::endl; Best wishes, Alex