Hi folks!
I got a cyclic type-dependency problem. I am trying to let every vertex
store a iterator to a list which stores vertex-iterators. This sounds
weired, but I need to keep track of very few vertices within my graph
which have a particle located at it. Thus I created a list of
vertex-iterators who carry my particle positions in the graph. In order
to be able to tell quickly if a vertice is taken by a particle I want
each vertice to include a pointer to a null element representing the
absence of a particle or a pointer into that list. My non-working code
looks like:
Definition of my graph:
struct Spot {
// acutally I need the vertex_iterator to be defined already
// in order to define particle, but this is not yet defined
// so I am using the knowledge that it is going to be represented
// by a vectorstd::size_t::iterator (at least I hope so)
// this assumption is WRONG!!
typedef std::list< std::vectorstd::size_t::iterator >::iterator \\
particle_t;
particle_t particle;
};
typedef boost::adjacency_list