Whoops ... the compiler must have been hallucinating :-)<div><br></div><div>I know I was; I can look up an edge, but can't remove one.�<br><div><br></div><div>I have tried it two ways:�</div><div><br></div><div>remove_edge(u,v,g);�</div> <div>and�</div><div>remove_edge(e,g);�</div><div><br></div><div>with u,v being vertices and e being an edge of course.�</div><div><br></div><div>Possible I do not have a MutableGraph but really I am not sure. I do know an edge exists between vertices u and v.�</div> <div><br></div><div>Eric<br><br><div class="gmail_quote">On Thu, Jun 10, 2010 at 12:46 AM, Cedric Laczny <span dir="ltr"><<a href="mailto:cedric.laczny@gmx.de">cedric.laczny@gmx.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;"> Hi,<br> <br> when I look at the error, I see that it complains about remove_edge().<br> However, I don't see any call of this in your example code. So I would suggest<br> that you either post a complete and short "working" example, or more carefully<br> select the lines that you post.<br> <br> Concerning the question in the title of your post, one way to check if there<br> is an edge between two vertices could be to get the adjacent vertices of<br> Vertex b and check if Vertex d is among them, or even to check if Vertex b has<br> any adjacent vertices at all. I know, this is probably not the nicest solution<br> but unless you don't use an AdjacencyMatrix graph, I don't know if this would<br> even be possible in a nicer way, so to say in O(1).<br> <br> Best,<br> <font color="#888888"><br> Cedric<br> </font><div><div></div><div class="h5"><br> On Thursday, 10. June 2010 06:59:24 Eric Fowler wrote:<br> > This should be easy ....<br> ><br> > typedef adjacency_list<vecS, vecS, undirectedS, POS<position_type>,<br> > LEN<position_type> > DG;<br> > typedef graph_traits<DG>::vertex_descriptor Vertex;<br> > typedef graph_traits<DG>::edge_descriptor Edge;<br> ><br> > ...<br> > Vertex b, d;<br> > ...populate b and ....<br> ><br> > bool bRet;<br> > Edge e;<br> ><br> > tie(e,bRet) = edge(b,d,*this);<br> ><br> > This earns me a lengthy error message from g++ (following).<br> ><br> > I notice that there is no function described for looking up an edge on an<br> > IncidenceGraph or an AdjacencyGraph ... hmm .... this puzzles me.<br> ><br> > What am I missing?<br> ><br> > Eric<br> ><br> > ../shuttle/trunk/DelaunayGraph.h:273: error: no matching function for call<br> > to �DelaunayGraph<int>::remove_edge(Edge&, DelaunayGraph<int>&)�<br> > /usr/include/boost/graph/detail/adjacency_list.hpp:848: note: candidates<br> > are: void boost::undirected_graph_helper<Config>::remove_edge(typename<br> > Config::edge_descriptor) [with Config =<br> > boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS,<br> > boost::undirectedS, POS<int>, LEN<int>, boost::no_property, boost::listS>,<br> > boost::vecS, boost::vecS, boost::undirectedS,<br> > boost::property<boost::vertex_bundle_t, POS<int>, boost::no_property>,<br> > boost::property<boost::edge_bundle_t, LEN<int>, boost::no_property>,<br> > boost::no_property, boost::listS>::config]<br> > /usr/include/boost/graph/detail/adjacency_list.hpp:859: note:<br> > � void boost::undirected_graph_helper<Config>::remove_edge(typename<br> > Config::out_edge_iterator) [with Config =<br> > boost::detail::adj_list_gen<boost::adjacency_list<boost::vecS, boost::vecS,<br> > boost::undirectedS, POS<int>, LEN<int>, boost::no_property, boost::listS>,<br> > boost::vecS, boost::vecS, boost::undirectedS,<br> > boost::property<boost::vertex_bundle_t, POS<int>, boost::no_property>,<br> > boost::property<boost::edge_bundle_t, LEN<int>, boost::no_property>,<br> > boost::no_property, boost::listS>::config]<br> > make: *** [MyDialog.o] Error 1<br> </div></div><div class="im">_______________________________________________<br> Boost-users mailing list<br> <a href="mailto:Boost-users@lists.boost.org">Boost-users@lists.boost.org</a><br> </div><div><div></div><div class="h5"><a href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">http://lists.boost.org/mailman/listinfo.cgi/boost-users</a></div></div></blockquote></div><br></div> </div>