EdgeListGraph
The EdgeListGraph concept refines the Graph concept, and adds the requirement for efficient access to all the edges in the graph.
Notation
G |
A type that is a model of EdgeListGraph. |
|---|---|
|
An object of type |
|
An object of type
|
Associated Types
boost::graph_traits<G>::traversal_category
This tag type must be convertible to edge_list_graph_tag.
boost::graph_traits<G>::edge_iteratorAn edge iterator (obtained via edges(g)) provides access to all of the
edges in a graph. An edge iterator type must meet the requirements of
MultiPassInputIterator.
The value type of the edge iterator must be the same as the edge
descriptor of the graph.
boost::graph_traits<G>::edges_size_typeThe unsigned integer type used to represent the number of edges in the graph.
Valid Expressions
|
Returns an iterator-range providing access to
all the edges in the graph |
|
Returns the number of edges in the graph |
|
Returns the vertex descriptor for u of the edge
(u,v) represented by |
|
Returns the vertex descriptor for v of the edge
(u,v) represented by |
Complexity guarantees
The edges(), source(), and target() functions must all return in
constant time.
Concept Checking Class
template <class G>
struct EdgeListGraphConcept
{
typedef typename boost::graph_traits<G>::edge_iterator
edge_iterator;
void constraints() {
BOOST_CONCEPT_ASSERT(( GraphConcept<G> ));
BOOST_CONCEPT_ASSERT(( MultiPassInputIteratorConcept<edge_iterator> ));
p = edges(g);
E = num_edges(g);
e = *p.first;
u = source(e, g);
v = target(e, g);
const_constraints(g);
}
void const_constraints(const G& g) {
p = edges(g);
E = num_edges(g);
e = *p.first;
u = source(e, g);
v = target(e, g);
}
std::pair<edge_iterator,edge_iterator> p;
typename boost::graph_traits<G>::vertex_descriptor u, v;
typename boost::graph_traits<G>::edge_descriptor e;
typename boost::graph_traits<G>::edges_size_type E;
G g;
};