It looks like the adjacency_iterator created by <meta charset="utf-8">adjacency_iterator_generator was being defined in terms of  vertex_descriptor and out_edge_iterator, which are in turn defined via graph_traits&lt;&gt;, which would cause this problem.<div>
<br></div><div>I got a little closer to an ideal solution by putting</div><div><br></div><div><div>    typedef ring_adjacency_iterator adjacency_iterator;</div></div><div><br></div><div>in the graph class and forward-defining ring_adjacency_iterator, then later on in implicit.hpp deriving ring_adjacency_iterator from boost::adjacency_iterator like so</div>
<div><br></div><div><div>  class ring_adjacency_iterator:public boost::adjacency_iterator&lt;</div><div>    graph,</div><div>    vertex_descriptor,</div><div>    out_edge_iterator,</div><div>    boost::use_default&gt; {</div>
<div>  public:</div><div>    typedef boost::adjacency_iterator&lt;</div><div>      graph,</div><div>      vertex_descriptor,</div><div>      out_edge_iterator,</div><div>      boost::use_default&gt; parent_class;</div><div>
    ring_adjacency_iterator() {};</div><div>    ring_adjacency_iterator(const out_edge_iterator&amp; ei, const graph* g):</div><div>      parent_class(ei, g) {};</div><div>  };</div></div><div><br></div><div>I didn&#39;t have to typedef the adjacency_iterator to void in the graph definition, so this is a valid AdjacencyGraph model.</div>
<div><br></div><div>I like this better than writing my own iterator_adaptor because it uses boost::adjacency_iterator, though it feels a little hacky because the body of ring_adjacency_iterator is mostly cut-and-pasted from adjacency_iterator.hpp.</div>
<div><br></div><div>I&#39;d like to find a way to define the adjacency iterator with the generator using the statement</div><div><br></div><div>  boost::adjacency_iterator_generator&lt;graph, vertex_descriptor, out_edge_iterator&gt;::type</div>
<div><br></div><div>but I haven&#39;t been able to do it.  This generator statement relies on graph_traits&lt;&gt; properties vertex_descriptor and out_edge_iterator, so has to come after the definition of implicit_ring::graph.  But that means I have to have a forward declaration of the adjacency_iterator, and I don&#39;t know how to forward-declare something I&#39;m getting from  boost::adjacency_iterator_generator&lt;&gt;::type.</div>
<div><br></div><div>It&#39;s still pretty good, but if this is going to be example code I&#39;d like to make sure I&#39;m doing it the best way possible.</div><meta charset="utf-8"><meta charset="utf-8"><meta charset="utf-8"><meta charset="utf-8"><meta charset="utf-8"><div>
<br><br><div class="gmail_quote">On Tue, Jun 29, 2010 at 7:08 AM, Jeremiah Willcock <span dir="ltr">&lt;<a href="mailto:jewillco@osl.iu.edu">jewillco@osl.iu.edu</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div class="im">On Mon, 28 Jun 2010, W.P. McNeill wrote:<br>
<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Take at look at the code up on <a href="http://github.com/wpm/Boost-Implicit-Graph-Example" target="_blank">http://github.com/wpm/Boost-Implicit-Graph-Example</a>.  Except for one compilation problem described below, I think this is done and<br>

ready to be included in an examples directory.<br>
I have implemented all the non-mutable graph concepts and have an edge weight property.  The main() function puts the graph through various paces then runs<br>
Dijkstra&#39;s algorithm.<br>
<br>
(I didn&#39;t model AdjacencyMatrix since the documentation indicates that this isn&#39;t used by any Boost algorithms, though it would be easy enough to implement.)<br>
</blockquote>
<br></div>
It is used indirectly (though lookup_edge()) but that function will fall back to using out_edges() if it can&#39;t find edge().  It just improves the complexity of the algorithm if you have a version of edge() that is faster than searching the list returned by out_edges().<div class="im">
<br>
<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
I decided not to implement a mutable vertex property map because I think this example is easiest to understand if it focuses exclusively on immutable graph<br>
concepts.  (Plus examples of how to create mutable vertex property maps are already easy to locate online.)<br>
<br>
My last bug is in the implementation of the AdjacencyGraph concept.  I&#39;m trying to use the Adjacency Iterator Adaptor.  When in the graph declaration I replace:<br>
<br>
    typedef void adjacency_iterator;<br>
<br>
with<br>
<br>
    typedef boost::adjacency_iterator_generator&lt;graph&gt;::type<br>
      adjacency_iterator;<br>
<br>
which I copied from the example in the online documentation I get a huge error spew which starts like this:<br>
<br>
g++ -g -I/opt/local/include -Wall -Werror -O3   -c -o main.o main.cpp<br>
/opt/local/include/boost/graph/graph_traits.hpp: In instantiation of ‘boost::graph_traits&lt;implicit_ring::graph&gt;’:<br>
implicit.hpp:113:   instantiated from here<br>
/opt/local/include/boost/graph/graph_traits.hpp:31: error: no type named ‘adjacency_iterator’ in ‘class implicit_ring::graph’<br>
/opt/local/include/boost/graph/graph_traits.hpp:34: error: no type named ‘vertex_iterator’ in ‘class implicit_ring::graph’<br>
/opt/local/include/boost/graph/graph_traits.hpp:35: error: no type named ‘edge_iterator’ in ‘class implicit_ring::graph’<br>
/opt/local/include/boost/graph/graph_traits.hpp:41: error: no type named ‘vertices_size_type’ in ‘class implicit_ring::graph’<br>
/opt/local/include/boost/graph/graph_traits.hpp:42: error: no type named ‘edges_size_type’ in ‘class implicit_ring::graph’<br>
/usr/include/c++/4.0.0/bits/stl_iterator_base_types.h: In instantiation of ‘std::iterator_traits&lt;implicit_ring::ring_incident_edge_iterator&gt;’:<br>
/opt/local/include/boost/detail/iterator.hpp:83:   instantiated from ‘boost::detail::iterator_traits&lt;implicit_ring::ring_incident_edge_iterator&gt;’<br>
/opt/local/include/boost/graph/adjacency_iterator.hpp:55:   instantiated from ‘boost::adjacency_iterator_generator&lt;implicit_ring::graph, size_t,<br>
implicit_ring::ring_incident_edge_iterator&gt;’<br>
implicit.hpp:113:   instantiated from here<br>
/usr/include/c++/4.0.0/bits/stl_iterator_base_types.h:129: error: invalid use of undefined type ‘struct implicit_ring::ring_incident_edge_iterator’<br>
<br>
The problem looks like unrecognized forward declarations of either the graph or ring_incident_edge_iterator, but I do have forward declarations for these.  Any<br>
ideas why this is failing.<br>
</blockquote>
<br></div>
I have a suspicion that adjacency_iterator is trying to instantiate graph_traits&lt;graph&gt;, which isn&#39;t complete yet since you&#39;re still giving its definition (i.e., you&#39;re trying to use a class to define itself).  If you use &quot;typedef void adjacency_iterator;&quot;, can you instantiate adjacency_iterator for your graph later (outside graph_traits)?<br>
<font color="#888888">
<br>
-- Jeremiah Willcock</font><br>_______________________________________________<br>
Boost-users mailing list<br>
<a href="mailto:Boost-users@lists.boost.org">Boost-users@lists.boost.org</a><br>
<a href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost-users</a><br></blockquote></div><br></div>