Boost C++ Libraries of the most highly regarded and expertly designed C++ library projects in the world. Herb Sutter and Andrei Alexandrescu, C++ Coding Standards

Click here to view the latest version of this page.
C++ Boost


Complexity: O(1)
Where Defined: boost/graph/graph_utility.hpp

  template <class Graph>
  std::pair<typename graph_traits<Graph>::vertex_descriptor,
            typename graph_traits<Graph>::vertex_descriptor>
  incident(typename graph_traits<Graph>::edge_descriptor e, Graph& g)
This function takes and edge descriptor and returns the pair of vertices that are incident to the edge. For directed graphs, the first vertex is the source and the second vertex is the target. This function is equivalent to the expression std::make_pair(source(e, g), target(e, g)).


  edge_descriptor e;
  vertex_descriptor u, v;
  tie(u, v) = incident(e, g);

Copyright © 2000-2001 Jeremy Siek, Indiana University (
Lie-Quan Lee, Indiana University (
Andrew Lumsdaine, Indiana University (