boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-11 11:52:12 +00:00
Code Issues Projects Releases Wiki Activity

fixed reference type for adjacency_iterator and added adjacency_graph_tag

Browse Source 
to the traversal category


[SVN r10179]
This commit is contained in:
Jeremy Siek
2001-05-21 20:07:21 +00:00
parent ccd4026450
commit e2a15d933f
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
include/boost/graph/leda_graph.hpp
View File

@@ -126,6 +126,7 @@ namespace boost {
struct leda_graph_traversal_category :
public virtual bidirectional_graph_tag,
public virtual adjacency_graph_tag,
public virtual vertex_list_graph_tag { };
template <class vtype, class etype>
@@ -135,7 +136,7 @@ namespace boost {
typedef boost::iterator_adaptor<edge,
boost::leda_adjacency_iterator_policies,
node, const node&, const node*,
node, node, const node*,
boost::multi_pass_input_iterator_tag,
std::ptrdiff_t
> adjacency_iterator;
@@ -156,7 +157,7 @@ namespace boost {
typedef boost::iterator_adaptor<node,
boost::leda_vertex_iterator_policies< GRAPH<vtype,etype> >,
node, const node&, const node*,
node, node, const node*,
boost::multi_pass_input_iterator_tag,
std::ptrdiff_t
> vertex_iterator;