-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Hi Dave !
On Tuesday 15 July 2003 00:31, David Abrahams wrote:
> Thoughts?
>
> Who's going to fix up the graph library?
I've attached the diff of a quick hack to get the BGL LEDA-Graph adaptor
to compile again.
I don't now whether this works, because I just got VC7.1 which should
enable me to use the power of boost on our legacy LEDA Graphs.
The are also problems with <boost/property_map_iterator.hpp>,
which is needed by <boost/graph/property_iter_range.hpp>
There is something along
struct lvalue_pmap_iter_policies : public default_iterator_policies
in this file, so it broke when the default_iterator_policies
dissappeared.
I had Thomas Witt take a look at it, but he did see no quick way to fix
this. And being a boost beginner myself, I'm unable to fix this.
(beside having problems accessing SF ...)
Yours, Jürgen
- --
* Dipl.-Math. Jürgen Hunold ! Institut für Verkehrswesen, Eisenbahnbau
* voice: ++49 511 762-2529 ! und -betrieb, Universität Hannover
* fax : ++49 511 762-3001 ! Appelstrasse 9a, D-30167 Hannover
* [EMAIL PROTECTED] ! www.ive.uni-hannover.de
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.2-rc1-SuSE (GNU/Linux)
iD8DBQE/Fq+oljbJ/LLrxrYRAgrbAKClagfiTE3Nzi6cDh9P90oQ2sUweQCg4AeS
IyrPxo+rA05wZOfaaxUcxS4=
=WI+a
-----END PGP SIGNATURE-----
Index: boost/graph/leda_graph.hpp
===================================================================
RCS file: /cvsroot/boost/boost/boost/graph/leda_graph.hpp,v
retrieving revision 1.17
diff -u -3 -p -r1.17 leda_graph.hpp
--- boost/graph/leda_graph.hpp 16 Jul 2002 14:57:08 -0000 1.17
+++ boost/graph/leda_graph.hpp 17 Jul 2003 08:46:34 -0000
@@ -155,29 +155,33 @@ namespace boost {
typedef boost::iterator_adaptor<leda_edge,
boost::leda_adjacency_iterator_policies,
- leda_node, leda_node, const leda_node*,
+ leda_node,
boost::multi_pass_input_iterator_tag,
+ leda_node,
std::ptrdiff_t
> adjacency_iterator;
typedef boost::iterator_adaptor<leda_edge,
boost::leda_out_edge_iterator_policies,
- leda_edge, const leda_edge&, const leda_edge*,
+ leda_edge,
std::forward_iterator_tag,
+ const leda_edge&,
std::ptrdiff_t
> out_edge_iterator;
typedef boost::iterator_adaptor<leda_edge,
boost::leda_in_edge_iterator_policies,
- leda_edge, const leda_edge&, const leda_edge*,
+ leda_edge,
std::forward_iterator_tag,
+ const leda_edge&,
std::ptrdiff_t
> in_edge_iterator;
typedef boost::iterator_adaptor<leda_node,
boost::leda_vertex_iterator_policies< GRAPH<vtype,etype> >,
- leda_node, leda_node, const leda_node*,
+ leda_node,
boost::multi_pass_input_iterator_tag,
+ leda_node,
std::ptrdiff_t
> vertex_iterator;
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
