- Boost-users - lists.preview.boost.org

RE: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Scott Sinclair 28 Nov '02

28 Nov '02

Hi Stephen Yes, just use a (1, n) or (n, 1) matrix as appropriate and do matrix operations instead of vector ops. The results will be correct as long as you make sure you have a correctly dimensioned matrix in place of your vector (i.e one that matches your vectors size and orientation). After all a matrix is just a collection of vectors ;-) cheers, Scott On 27/11/2002 05:10, Stephen Crowley wrote > It is possible for a vector and a matrix to share the same storage, as > long as the dimensions agree? > > Some of the algorithms I am implementing require some objects > to be treated > as an arbitrarily sized matrix, and sometimes as a vector, > and it would be > convient to have a matrix and a vector share the same memory. > > -- > Stephen The contents of this email may be confidential. Unauthorised use is prohibited. Umgeni Water does not accept liability for any statements and opinions which are the sender's own view and not expressly made on its behalf.

4 4

RE: [Boost-Users] MSVC++, bind and namespaces
by Antoine Boivin Filion 28 Nov '02

28 Nov '02

Hi, FYI, the code below compiles and runs OK on MSVC++7... so you might just be right! Regards, Antoine -----Original Message----- From: Andre Hentz [mailto:ahentz@cariden.com] Sent: November 28, 2002 09:42 To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] MSVC++, bind and namespaces I've just encountered this problem and it looks like a MS bug. Not sure it deserves a Boost workaround but I thought it would be nice to let you know (in case you don't already). Here's the code: #include <boost/bind.hpp> namespace A{ struct c{ void setName(const char*) {} }; } namespace B{ struct c{ void setName(const char*) {} }; } using namespace B; using namespace A; int main() { boost::bind(&A::c::setName, _1, _2); return 0; } It looks legal to me but I'm no expert. GCC compiles with no warnings but MSVC++ 6sp5 gives the error below. boost/bind/mem_fn_vw.hpp(29) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void ,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,cla ss boost::arg<2> > >' being compiled boost/bind/mem_fn_vw.hpp(31) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled Best, Andre Hentz Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=237459.2675695.4055211.2225243/D=egroupweb/S=17050067 88:HM/A=1267611/R=0/*http://ad.doubleclick.net/jump/N2524.Yahoo/B1071650;sz= 300x250;ord=1038499880908608?> <http://us.adserver.yahoo.com/l?M=237459.2675695.4055211.2225243/D=egroupmai l/S=:HM/A=1267611/rand=601430356> Info: < http://www.boost.org <http://www.boost.org> > Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

1 0

Re: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Toon Knapen 28 Nov '02

28 Nov '02

On Wednesday 27 November 2002 20:46, Stephen Crowley wrote: > What do you mean by "just use it as" ? > > For example.. I have a matrix<double> m(5,5); > > In some code I actually need to use it as a 5x5 matrix.. but other parts > must reference it as a vector (to pass to another library). OK, So as to get to the bottom of this. Do you really want to perform vector operations on a vector that consists of a concatenation of all rows (or columns) of the matrix do you want to get access to the storage to pass your information to another library. The latter case is dealt with in the boost-sandbox/boost/numeric/bindings. There we've spend effort to be able to extract the begin- and end-pointer (not iterator) from any vector or matrix. (In the bindings it's used to pass these pointers to e.g. BLAS) In the former case, could you enlighten me what kind of numeric operations you're dealing with ? toon -------------------------------------------------------

1 0

MSVC++, bind and namespaces
by Andre Hentz 28 Nov '02

28 Nov '02

I've just encountered this problem and it looks like a MS bug. Not sure it deserves a Boost workaround but I thought it would be nice to let you know (in case you don't already). Here's the code: #include <boost/bind.hpp> namespace A{ struct c{ void setName(const char*) {} }; } namespace B{ struct c{ void setName(const char*) {} }; } using namespace B; using namespace A; int main() { boost::bind(&A::c::setName, _1, _2); return 0; } It looks legal to me but I'm no expert. GCC compiles with no warnings but MSVC++ 6sp5 gives the error below. boost/bind/mem_fn_vw.hpp(29) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void ,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,cla ss boost::arg<2> > >' being compiled boost/bind/mem_fn_vw.hpp(31) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled Best, Andre Hentz

1 0

Re: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Toon Knapen 28 Nov '02

28 Nov '02

On Wednesday 27 November 2002 20:46, Stephen Crowley wrote: > What do you mean by "just use it as" ? > > For example.. I have a matrix<double> m(5,5); > > In some code I actually need to use it as a 5x5 matrix.. but other parts > must reference it as a vector (to pass to another library). OK, So as to get to the bottom of this. Do you really want to perform vector operations on a vector that consists of a concatenation of all rows (or columns) of the matrix do you want to get access to the storage to pass your information to another library. The latter case is dealt with in the boost-sandbox/boost/numeric/bindings. There we've spend effort to be able to extract the begin- and end-pointer (not iterator) from any vector or matrix. (In the bindings it's used to pass these pointers to e.g. BLAS) In the former case, could you enlighten me what kind of numeric operations you're dealing with ? toon

1 0

RE: [Boost-Users] Is intrusive_ptr the thing to use?
by Hickman, Greg 28 Nov '02

28 Nov '02

From: Peter Dimov [mailto:pdimov@mmltd.net] > From: "Hickman, Greg" <greg.hickman(a)lmco.com> > > > From: Peter Dimov [mailto:pdimov@mmltd.net] > > > If 'f' is virtual, have the object store a weak_ptr to itself: > > > > > > class X > > > { > > > private: > > > > > > weak_ptr<X> weak_this; > > > > > > X(); > > > X(X const &); > > > X& operator=(X const &); > > > > > > public: > > > > > > static shared_ptr<X> create() > > > { > > > shared_ptr<X> px(new X); > > > px->weak_this = px; > > > return px; > > > } > > > > I must be missing something here, because it appears as though you > > can't derive a Y from X and still initialize X::weak_this. > > You could simply make X::weak_this and X::X() protected... > although if you follow the design rule that says that > non-leaf classes should be abstract (and if possible contain > no data) this shouldn't be necessary, as X as pictured above > would be a leaf. Its seems the leaf itself must implement the factory method/weak_this idiom. This initially didn't seem like a good idea in our case since clients write the leaves - we only provide X. But on second thought, perhaps two alternatives are (1) provide a helper template for clients to use when deriving from X to automatically declare the static create()/weak_this pair, or (2) use an intrusive reference counting approach for X. If an intrusive approach ultimately works better for us, what should I do as a boost 1.29.0 user: use counted_base/shared_from_this, or intrusive_ptr (which I admittedly haven't even looked at)? Any suggestions you have are more than welcome. -Greg

2 1

RE: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Scott Sinclair 28 Nov '02

28 Nov '02

Sorry, I obviously misunderstood your original question :( On 28/11/2002 03:46 Stephen Crowley wrote: > What do you mean by "just use it as" ? > For example.. I have a matrix<double> m(5,5); > > In some code I actually need to use it as a 5x5 matrix.. but > other parts > must reference it as a vector (to pass to another library). > > Currently I am doing something like this > > matrix<double> m(5,5); > // do stuff to m > vector<double> v(25); > v.data() = m.data(); > // pass v to library > // get results back > m.data() = v.data(); > > This is obviously not optimal.. and if both m.data() and > v.data() pointed to > the same location in memory the problem would be solved. > > I suppose I might be able to get around it by making my own > storage class > that allows you to specify a location and size instead of > allocating one > itself. > > --Stephen The contents of this email may be confidential. Unauthorised use is prohibited. Umgeni Water does not accept liability for any statements and opinions which are the sender's own view and not expressly made on its behalf.

1 0

RE: [Boost-Users] Is intrusive_ptr the thing to use?
by Hickman, Greg 27 Nov '02

27 Nov '02

> -----Original Message----- > From: Peter Dimov [mailto:pdimov@mmltd.net] > Sent: Tuesday, November 26, 2002 6:49 AM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] Is intrusive_ptr the thing to use? > If 'f' is virtual, have the object store a weak_ptr to itself: > > class X > { > private: > > weak_ptr<X> weak_this; > > X(); > X(X const &); > X& operator=(X const &); > > public: > > static shared_ptr<X> create() > { > shared_ptr<X> px(new X); > px->weak_this = px; > return px; > } I must be missing something here, because it appears as though you can't derive a Y from X and still initialize X::weak_this. -Greg

2 1

solaris gcc 3.2 stlport regexp (bug?)
by c_twiner 27 Nov '02

27 Nov '02

Hi all, When I use bjam to compile the regexp library it compiles seems happy and then no code works properly, seg faults, rubbish results etc. When I compile using a modified make file of the shared-gcc.mak (modifications follow): INCLUDES= -I/export/home/ctwiner/STLport-4.5.3/stlport -L/export/home/ctwiner/STLport-4.5.3/lib LIBS= -lstlport_gcc_stldebug # compiler: CXX=g++ LINKER=g++ -shared -fPIC # # compiler options for release build: # C1=-c -O2 -I../../../ -fPIC # # compiler options for debug build: # C2=-c -g -I../../../ -fPIC It builds but even linking to the .so created causes a seg fault. I know that stlport is ok because I have programs linking to the new version using std::map's vectors and strings. I posted another message using 2.95 which had the same/similar problems. Everything seems to build fine but running causes seg faults. The solaris version is 2.8. When using the bjam built files and trying to run the compiled regexp_tests the locale_impl.h of stlports asserts at line 60. latest downloads of all librarys have been used. TIA Chris

3 10

ublas::matrix sharing storage with ublas::vector
by Stephen Crowley 27 Nov '02

27 Nov '02

It is possible for a vector and a matrix to share the same storage, as long as the dimensions agree? Some of the algorithms I am implementing require some objects to be treated as an arbitrarily sized matrix, and sometimes as a vector, and it would be convient to have a matrix and a vector share the same memory. -- Stephen

2 1

Link problem with boost::signals and console applications in MS Visual C++ 6 / Windows
by Klaus Nowikow 26 Nov '02

26 Nov '02

Hi all, a colleague asked me to post the following question: When using the boost signal lib in VC6 (Win32 Console Application), the linker produces the following errors: msvcprt.lib(MSVCP60.dll) : error LNK2005: "public: __thiscall std::_Lockit::~_Lockit(void)" (??1_Lockit@std@@QAE@XZ) already defined in libcpd.lib(iostream.obj) msvcprt.lib(MSVCP60.dll) : error LNK2005: "public: __thiscall std::_Lockit::_Lockit(void)" (??0_Lockit@std@@QAE@XZ) already defined in libcpd.lib(iostream.obj) MSVCRT.lib(MSVCRT.dll) : error LNK2005: "public: __thiscall exception::exception(class exception const &)" (??0exception@@QAE@ABV0@@Z) already defined in LIBCD.lib(stdexcpt.obj) MSVCRT.lib(MSVCRT.dll) : error LNK2005: "public: __thiscall exception::exception(void)" (??0exception@@QAE@XZ) already defined in LIBCD.lib(stdexcpt.obj) MSVCRT.lib(MSVCRT.dll) : error LNK2005: "public: virtual __thiscall exception::~exception(void)" (??1exception@@UAE@XZ) already defined in LIBCD.lib(stdexcpt.obj) LINK : warning LNK4098: defaultlib "MSVCRT" conflicts with use of other libs; use /NODEFAULTLIB:library Debug/boost.exe : fatal error LNK1169: one or more multiply defined symbols found There seems to be a conflict between the libraries signals.lib, libcpd.lib and libcd.lib. When I try to ignore the libraries libcpd.lib and libcd.lib in the project settings, other linker errors occur when I use std::cout for example: main.obj : error LNK2001: unresolved external symbol "class std::basic_ostream<char,struct std::char_traits<char> > std::cout" (?cout@std@@3V?$basic_ostream@DU?$char_traits@D@std@@@1@A) Is there a way to use the boost::signals library in a Win32 Console Application in VC6? Regards, Klaus

3 3

Is intrusive_ptr the thing to use?
by Hickman, Greg 26 Nov '02

26 Nov '02

I need an object managed through a shared_ptr to be able to pass itself (i.e., this) to another object which also expects a shared_ptr. Is there a preferred implementation technique for this when using the boost smart pointers? I think I've seen conversation in the past about deriving from boost::counted_base and calling shared_from_this(), but I think I also remember seeing comments to the effect that this is going away. OTOH, I know there's something called intrusive_ptr that's currently undocumented. Should I be using one of these approaches? If the answer is intrusive_ptr, are there docs? Should I roll my own? What's a Booster to do? -Greg

3 2

matrix inside a matrix?
by Stephen Crowley 26 Nov '02

26 Nov '02

Is it possible to define a matrix that is part of a larger matrix, without having to create temporaries and copy part of the larger? /----------\ | | | | SM | | |----| LM | | | \----------/ I need to extract a sub-section of a matrix, multiply it, and then copy it back. I am currently using a temporary, but I have a feeling there must be a better way. -- Stephen

2 1

RE: [Boost-Users] Is intrusive_ptr the thing to use?
by Mark Storer 25 Nov '02

25 Nov '02

>The only problem with it currently is that the >smart_class MUST be managed with smart_ptrs, >if you try to 'delete' it, it will try to delete >itself and crash. This seems like a problem that could be overcome through overloading the "delete" operator. Perhaps if you declared your delete operator as protected (or private), and then made the smart pointers you wanted to use friends? That would force you to use a specific set of smart pointer classes, but that doesn't sound like it would be a problem in your case. It's fixing the symptom rather than the disease, but is better than nothing. Turning runtime errors into compiletime errors is always a Good Thing. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

2 1

RE: [Boost-Users] Re: uBLAS, MTL performance tests.
by Randy Bowen 25 Nov '02

25 Nov '02

Actually, default behavior of the IDE is to define "_DEBUG" in the debug configurations, and "NDEBUG" in the release versions. Those are set as defaults for all files, but may be overridden on a case-by-case basis as necessary. This is a bit off topic for the Boost list. If you have other questions in this area, feel free to email me directly. Randy Bowen rbowen(a)stamps.com -----Original Message----- From: Jon Agiato [mailto:JonAgiato@nyc.rr.com] Sent: Friday, November 22, 2002 6:32 PM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] Re: uBLAS, MTL performance tests. Thanks Randy! Would you know if it is also set for release by default as well? Jon Agiato JonAgiato(a)nyc.rr.com ----- Original Message ----- From: Randy Bowen To: Boost-Users(a)yahoogroups.com Sent: Friday, November 22, 2002 6:40 PM Subject: RE: [Boost-Users] Re: uBLAS, MTL performance tests. > > > add -DNDEBUG to command line arguments. Unfortunately > I don't know where exactly you can edit command line > arguments in VC.NET. > > Alexei. > In VC.NET, this can be set under Project Properties -> C/C++ -> Preprocessor -> Preprocessor Definitions. (It's normally preset for debug configurations.) Randy Bowen Yahoo! Groups Sponsor ADVERTISEMENT Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service. [Non-text portions of this message have been removed] Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

1 0

johnson algorithm, bug or feature?
by Ramón Casero Cañas 25 Nov '02

25 Nov '02

I have tested the johnson_all_pairs_shortest_paths example of libboost-graph 1.28. It's a directed graph. Shortest path from vertex 3 to vertex 0 weights "inf" (all edges of vertex 0 are outgoing edges). That's OK. Now we change the graph from directedS to undirectedS. The path weights now "5": 0 1 2 3 4 5 0 -> 0 0 -1 -5 0 -4 1 -> 0 0 -1 -5 0 -4 2 -> 1 1 0 -4 1 -3 3 -> 5 5 4 0 5 1 4 -> 0 0 -1 -5 0 -4 5 -> 4 4 3 -1 4 0 But if the path is 3-> 4 -> 0, should it not be "-5"? Why does the algorithm change the sign in an undirected graph? In this reference of NIST http://www.nist.gov/dads/HTML/johnsonsAlgorithm.html we can read: "Johnson's algorithm (algorithm) Definition: An algorithm to solve the all pairs shortest path problem in a sparse weighted, directed graph". So, is it really the problem that Johnson's algorithm doesn't work on undirected graphs? If so, shouldn't the function throw a compilation error/warning and/or be warned in the documentation? Regards, Ramón.

1 0

RE: [Boost-Users] Re: uBLAS, MTL performance tests.
by Randy Bowen 23 Nov '02

23 Nov '02

> > > add -DNDEBUG to command line arguments. Unfortunately > I don't know where exactly you can edit command line > arguments in VC.NET. > > Alexei. > In VC.NET, this can be set under Project Properties -> C/C++ -> Preprocessor -> Preprocessor Definitions. (It's normally preset for debug configurations.) Randy Bowen

2 1

RE: [Boost-Users] What is wrong with the GLPL?
by Tom Matelich 23 Nov '02

23 Nov '02

> From: Steve M. Robbins [mailto:steven.robbins@videotron.ca] > Sent: Friday, November 22, 2002 5:43 PM > On Fri, Nov 22, 2002 at 10:01:59AM -0500, > scleary(a)jerviswebb.com wrote: > > > There is a second problem with the LGPL in its restrictions > of modified > > copies of the original source (i.e., you can't take an LGPL > library, enhance > > it, and then sell it). > > I am unable to let this go unchallenged. > > There is not any provision in the license language that prevents one > from enhancing an LGPL library and selling it. > > Most likely you meant to say "you can't take an LGPL library, enhance > it, and then sell it while hiding your enhancements". That would > be a true statement. In the spirit of challenging... If you take an LGPL library, and enhance it, you must provide the source for the changes you made, so selling it wouldn't do you much good, that I can see. ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

RE: [Boost-Users] What is wrong with the GLPL?
by scleary＠jerviswebb.com 23 Nov '02

23 Nov '02

> -----Original Message----- > From: Markus Werle [mailto:yg-boost-users@m.gmane.org] > > Hi! > > I just came across http://www.boost.org/more/lib_guide.htm#License > where it is stated that any boost library license > > - Must be simple to read and understand. > - Must grant permission to copy, use and modify the software for > any use (commercial and non-commercial) for no fee. > - Must require that the license appear on all copies of the > software source code. > - Must not require that the license appear with executables > or other binary > uses of the library. > - Must not require that the source code be available for > execution or other > binary uses of the library. > - May restrict the use of the name and description of the library to > the standard version found on the Boost web site. > > At the same place one can find > > "Restricted licenses like the GPL and LGPL are not acceptable." > > I may have overlooked something, but I feel like the LGPL meets the > requirements above. Could You please explain or point to further > information about this issue. The main problem with LGPL is the "relinking" clause, which requires any distributer of a work that uses the library to allow the end-user to re-link the executable with a different version of the LGPL'ed library. While this makes sense for traditional libraries, it causes real problems when templates get involved; think of what this means for template libraries covered by the LGPL: in order to allow the user to relink with a newer version of the LGPL library (which is the intent of this clause), the source that uses the LGPL'ed templates must be distributed. There is a second problem with the LGPL in its restrictions of modified copies of the original source (i.e., you can't take an LGPL library, enhance it, and then sell it). This is not to imply that LGPL or GPL are bad choices for a project; I'm working on a GPL project myself. But they don't fall under Boost's "totally free" licencing guidelines. If you want more info for your licencing decision, check out the Open Source Initiative (http://www.opensource.org/) -Steve

2 1

uBLAS, MTL performance tests.
by alexei_novakov 22 Nov '02

22 Nov '02

Hello, I did some performance tests with uBLAS and MTL. Here are some results for those who is interested. The following tests were run: 1) uBLAS dense matrix multiplication: - row_major * row_major: ures.assign(prod(ur, ur)) - row_major * column_major: ures.assign(prod(ur, uc)) - column_major * row_major: ures.assign(prod(uc, ur)) 2) MTL dense matrix multiplication: - row_major * row_major: mult(mr, mr, mres) - row_major * column_major: mult(mr, mc, mres) - column_major * row_major: mult(mc, mr, mres) 3) C matrix multiplication (basic multiplication algorithm for C array). 4) uBLAS sparse matrix multiplication (20% of non-zera elements): - row_major * row_major: ures.assign(prod(ur, ur)) - row_major * column_major: ures.assign(prod(ur, uc)) - column_major * row_major: ures.assign(prod(uc, ur)) ures - is dense matrix. 5)MTL sparse marix multiplication (20% of non-zera elements): - row_major * row_major: mult(mr, mr, mres) - row_major * column_major: mult(mr, mc, mres) - column_major * row_major: mult(mc, mr, mres) mres - is dense matrix. All tests were run on Windows2000, I used gcc 3.2 with -O3 optimization flag. boost 1.29 was used. Here are some results: 1) uBLAS and MTL have approximately the same performance for dense matrix mult. uBLAS is a bit faster with small matrices (< 50-100), MTL is faster with large ones (>100). 2) When working with C array multiplication it is 5-6 times faster than both uBLAS and MTL. (!!!) 3) If I use my own simple mult funcion to mutiply uBLAS or MTL matrices: template <typename Mat> void mat_mat_mult(const Mat& m1, const Mat& m2, Mat& res, int rank) { for(int i = 0; i < rank; ++i) for(int j = 0; j < rank; ++j) { res(i, j) = 0; for(int k = 0; k < rank; ++k) res(i, j) += m1(i, k) * m2(k, j); } } It works 2 times faster than native uBLAS and MTL implementations of multiplication. (Iterators overhead?) 4) Dense matrix performance doesn't depend on row orientation neither for uBLAS nor for MTL. 5) MTL sparse matrix mult doesn't depend on row orientation and in any case much (2 times) faster than the best case for uBLAS. 6) uBLAS gives best performance for sparse matrices in row_major * column_major case (it is 3 times faster than column_major * row_major). 7) When I tryed latest uBLAS from boost cvs. It worked much (up to 2 times) slower for sparse matrices than 1.29. I would need to do other tests to make any real conclusions, but preliminary it seams to me that abstraction penalty for both uBLAS and MTL is too big. Alexei.

4 5

boost/jam/solaris
by gpolicello 22 Nov '02

22 Nov '02

Hello, I'm trying to port a simple app written in MSVC for NT to Solaris. The compiler we are using is Sun Workshop. How do I build boost? I've downloaded bjam_solaris but it won't compile. Apparantly, it is bringing in gcc-tools. Am I going to have to write a new tools file for Sun's compiler? Is there a simple make file I can use instead of jam? Thanks, - George

1 0

RE: [Boost-Users] What is wrong with the GLPL?
by Jim.Hyslop 22 Nov '02

22 Nov '02

Markus Werle [mailto:yg-boost-users@gmane.org] wrote: > I just came across http://www.boost.org/more/lib_guide.htm#License [...] > At the same place one can find > > "Restricted licenses like the GPL and LGPL are not acceptable." > > I may have overlooked something, but I feel like the LGPL meets the > requirements above. Could You please explain or point to further > information about this issue. Section 4 of the LGPL states: " 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code...." (http://www.gnu.org/licenses/lgpl.txt) This violates the Boost requirement "Must not require that the source code be available for execution or other binary uses of the library." -- Jim

1 0

What is wrong with the GLPL?
by Markus Werle 22 Nov '02

22 Nov '02

Hi! I just came across http://www.boost.org/more/lib_guide.htm#License where it is stated that any boost library license - Must be simple to read and understand. - Must grant permission to copy, use and modify the software for any use (commercial and non-commercial) for no fee. - Must require that the license appear on all copies of the software source code. - Must not require that the license appear with executables or other binary uses of the library. - Must not require that the source code be available for execution or other binary uses of the library. - May restrict the use of the name and description of the library to the standard version found on the Boost web site. At the same place one can find "Restricted licenses like the GPL and LGPL are not acceptable." I may have overlooked something, but I feel like the LGPL meets the requirements above. Could You please explain or point to further information about this issue. This is not intended as a political discussion (though it might turn to that) I am just trying to find the best free license model for my own yet-to-publish Expression Template Library. Thanks, Markus

1 0

Boost, VC++5 and PThreads-Win32 [newbee]
by Regis Desgroppes 22 Nov '02

22 Nov '02

Hello, I have to use Boost with VC++5 even if it this compiler isn't supposed to be supported. That's because we have a quite huge software developped with VC++5 and we don't have enough time to re-pass the entire test book (several hundreds of pages with 10 pixel-sized fonts). By disabling the #error directive in the compiler configuration hpp file, I'm surprised to see all seem to work fine. So my 1st question is : - Why such a #error directive ? Moreover, I have a POSIX.1c compliant threads implementation under WIN32 (PThreads Win32 downloaded from the RedHat site) that I want to use. So my 2nd question is : - What are the right minimum set of #define's I have to put (_REENTRANT, _POSIX_THREADS, BOOST_DISABLE_WIN32, etc.) ? Thank you very, very, much in advance, Best regards, Regis.

3 5

dijkstra_shortest_paths cannot manage <listS, listS...>?
by Ramón Casero Cañas 21 Nov '02

21 Nov '02

While trying to use this function, I got a large warning output (see the end of this message). The code is the same as in the dijkstra-example.cpp, but changing the adjacency_list to: ------------adjacency_list definition ------------------------ using namespace boost; /* data structures definitions */ namespace boost { enum vertex_to_be_spanned_t { // used to mark vertices of W vertex_to_be_spanned }; BOOST_INSTALL_PROPERTY(vertex, to_be_spanned); } namespace steiner { typedef std::pair<int,int> Edge; // type of edges /* Steiner Problem Graph: * - multigraph * - add_edge(), ... stability and speed, bad space overhead * - vertex indices, edge weights */ // typedef int WeightType; typedef property <vertex_index_t, int, property <vertex_to_be_spanned_t, bool> > VertexProperty; typedef property <edge_weight_t, int> EdgeProperty; typedef adjacency_list <listS, listS, undirectedS, VertexProperty, EdgeProperty > SteinerGraph; } ------------adjacency_list definition (end) ------------------------ Maybe I'm making some mistake that is obvious if you master the library, but I just don't understand what happens. I made some changes, to see what happended, and changing typedef adjacency_list <listS, listS, undirectedS, for typedef adjacency_list <listS, vecS, undirectedS, seems to work. At least, the warning messages disappear when compiling. Regards, Ramón Casero. PS. I copied the dijkstra-example.cpp file to /tmp, edited it to change the adjacency_list definition, and compiled with g++ -o /tmp/dijkstra -pedantic -Wall -g -ftemplate-depth-50 -O2 -lboost_thread -lstlport -lm -lefence -g /tmp/dijkstra-example.cpp I'm using gcc version 2.95.4 20011002 (Debian prerelease) in Debian Sarge. ------------------ warning --------------------- /tmp/dijkstra-example.cpp: In function `int main(int, char **)': /tmp/dijkstra-example.cpp:73: warning: initialization to `vertex_descriptor' from `void *' lacks a cast /usr/include/boost/graph/dijkstra_shortest_paths.hpp: In function `void boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, vertex_descriptor *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int>(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::n o_property,boost::listS> &, void *, vertex_descriptor *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int, boost::dijkstra_visitor<boost::null_visitor>)': /usr/include/boost/graph/dijkstra_shortest_paths.hpp:237: instantiated from `boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t ,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:259: instantiated from `boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t ,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<steiner::SteinerGraph, int *, boost::vertex_distance_t, boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> >(const steiner::SteinerGraph &, void *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /tmp/dijkstra-example.cpp:84: instantiated from here /usr/include/boost/graph/dijkstra_shortest_paths.hpp:198: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /usr/include/boost/property_map.hpp: In function `void put<vertex_descriptor, void *>(vertex_descriptor *, int, void *const &)': /usr/include/boost/graph/dijkstra_shortest_paths.hpp:199: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, vertex_descriptor *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int>(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::n o_property,boost::listS> &, void *, vertex_descriptor *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int, boost::dijkstra_visitor<boost::null_visitor>)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:237: instantiated from `boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t ,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:259: instantiated from `boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t ,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<steiner::SteinerGraph, int *, boost::vertex_distance_t, boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> >(const steiner::SteinerGraph &, void *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /tmp/dijkstra-example.cpp:84: instantiated from here /usr/include/boost/property_map.hpp:133: warning: assignment to `unsigned int' from `void *const' lacks a cast /usr/include/boost/graph/dijkstra_shortest_paths.hpp: In function `void boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, vertex_descriptor *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int>(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::n o_property,boost::listS> &, void *, vertex_descriptor *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, less<int>, boost::closed_plus<int>, int, int, boost::dijkstra_visitor<boost::null_visitor>)': /usr/include/boost/graph/dijkstra_shortest_paths.hpp:237: instantiated from `boost::detail::dijkstra_dispatch2<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t ,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:259: instantiated from `boost::detail::dijkstra_dispatch1<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t ,int,boost::no_property>,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<steiner::SteinerGraph, int *, boost::vertex_distance_t, boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> >(const steiner::SteinerGraph &, void *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' /tmp/dijkstra-example.cpp:84: instantiated from here /usr/include/boost/graph/dijkstra_shortest_paths.hpp:199: warning: passing `void *' to argument 2 of `put<vertex_descriptor, void *>(vertex_descriptor *, int, void *const &)' lacks a cast /usr/include/boost/graph/dijkstra_shortest_paths.hpp:201: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /tmp/dijkstra-example.cpp: In function `int main(int, char **)': /tmp/dijkstra-example.cpp:84: warning: passing `vertex_descriptor' to argument 2 of `boost::dijkstra_shortest_paths<steiner::SteinerGraph, int *, boost::vertex_distance_t, boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> >(const steiner::SteinerGraph &, void *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::bgl_named_params<unsigned int *,boost::vertex_predecessor_t,boost::no_property> > &)' lacks a cast /tmp/dijkstra-example.cpp:48: warning: unused variable `char name[6]' /usr/include/boost/graph/relax.hpp: In function `bool boost::relax<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, vertex_descriptor *, int *, boost::closed_plus<int>, less<int> >(boost::detail::edge_desc_impl<boost::directed_tag,void *>, const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &, boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>, vertex_descriptor *, int *, boost::closed_plus<int>, less<int>)': /usr/include/boost/graph/dijkstra_shortest_paths.hpp:103: instantiated from `boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >::tree_edge<boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost::a djacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &)' /usr/include/boost/graph/breadth_first_search.hpp:51: instantiated from `boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> >::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> > >(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_qu eue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> > > *)' /usr/include/boost/graph/breadth_first_search.hpp:75: instantiated from `boost::breadth_first_visit<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,bo ost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_map<boost::default_color_type *,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::ed ge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &, void *, boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_map<boost::default_color_type *,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &>)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:178: instantiated from here /usr/include/boost/graph/relax.hpp:69: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/graph/relax.hpp:69: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/graph/dijkstra_shortest_paths.hpp:103: instantiated from `boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >::tree_edge<boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost::a djacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &)' /usr/include/boost/graph/breadth_first_search.hpp:51: instantiated from `boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> >::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> > >(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_qu eue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> > > *)' /usr/include/boost/graph/breadth_first_search.hpp:75: instantiated from `boost::breadth_first_visit<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,bo ost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_map<boost::default_color_type *,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::ed ge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &, void *, boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_map<boost::default_color_type *,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &>)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:178: instantiated from here /usr/include/boost/graph/relax.hpp:73: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /usr/include/boost/graph/relax.hpp:74: warning: passing `void *' to argument 2 of `put<vertex_descriptor, void *>(vertex_descriptor *, int, void *const &)' lacks a cast /usr/include/boost/pending/indirect_cmp.hpp: In method `bool boost::indirect_cmp<int *,less<int> >::operator ()<void *, void *>(void *const &, void *const &) const': /usr/include/boost/graph/detail/array_binary_tree.hpp:183: instantiated from `adstl::compare_array_node<vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >::operator ()<adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > >(const adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, const adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/stl_algo.h:2520: instantiated from `min_element<adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >::children_type::iterator, adstl::compare_array_node<vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> > > >(adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >::children_type::iterator, adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_prop erty>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >::children_type::iterator, adstl::compare_array_node<vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >)' /usr/include/boost/pending/mutable_heap.hpp:62: instantiated from `boost::down_heap<adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node<vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >, vector<unsigned int,allocator<unsigned int> > >(adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<bo ost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node<vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >, vector<unsigned int,allocator<unsigned int> > &)' /usr/include/boost/pending/mutable_heap.hpp:75: instantiated from `boost::update_heap<adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node<vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >, vector<unsigned int,allocator<unsigned int> > >(adstl::array_binary_tree_node<void **,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, adstl::compare_array_node<vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> > >, vector<unsigned int,allocator<unsigned int> > &)' /usr/include/boost/pending/mutable_queue.hpp:119: instantiated from `boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >::update(void *const &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:114: instantiated from `boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >::gray_target<boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::directed_tag,void *>, boost: :adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &)' /usr/include/boost/graph/breadth_first_search.hpp:53: instantiated from `boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> >::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> > >(boost::type<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_qu eue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> > > *)' /usr/include/boost/graph/breadth_first_search.hpp:75: instantiated from `boost::breadth_first_visit<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>, boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >, boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,bo ost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_map<boost::default_color_type *,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &> >(const boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::ed ge_weight_t,int,boost::no_property>,boost::no_property,boost::listS> &, void *, boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> > &, boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<boost::null_visitor>,boost::mutable_queue<void *,vector<void *,allocator<void *> >,boost::indirect_cmp<int *,less<int> >,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::directed_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::no_property>,boost::edge_weight_t>,unsigned int *,int *,boost::closed_plus<int>,less<int> >, boost::iterator_property_map<boost::default_color_type *,boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::directedS,boost::property<boost::vertex_index_t,int,boost::property<boost::vertex_to_be_spanned_t,bool,boost::no_property> >,boost::property<boost::edge_weight_t,int,boost::no_property>,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>,boost::default_color_type,boost::default_color_type &>)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:178: instantiated from here /usr/include/boost/pending/indirect_cmp.hpp:59: warning: passing `void *const' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/pending/indirect_cmp.hpp:59: warning: passing `void *const' to argument 2 of `get<int>(const int *, int)' lacks a cast

1 0