- 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

RE: [Boost-Users] more then 254 threads?
by Randy Bowen 21 Nov '02

21 Nov '02

The quote from the documentation on CreateThread for Windows 2000 is: The number of threads a process can create is limited by the available virtual memory. By default, every thread has one megabyte of stack space. Therefore, you can create at most 2028 threads. If you reduce the default stack size, you can create more threads. However, your application will have better performance if you create one thread per processor and build queues of requests for which the application maintains the context information. A thread would process all requests in a queue before processing requests in the next queue. For Windows operating systems, the design pattern suggested here is definitely preferable. Randy Bowen -----Original Message----- From: Eske Christiansen [mailto:eske@greennet.gl] Sent: Thursday, November 21, 2002 4:44 AM To: Boost-Users(a)yahoogroups.com Subject: SV: [Boost-Users] more then 254 threads? I came to to the same conclusion and it set me back a little. My ideer to create that many threads was to code a kind of AI Life, where each life square lives in its own thread. It was only to test how well the linux kernel handle the creation and delettion of many threads each second. So I will insted try to make a micro-thread system inside 255 threads and se how well the kernel scale. Does windows 2k and after have the same problems? yours eske > > Eske Christiansen said: >> Hej boost-users. >> >> I'm compiling a test thread program where I create 255 thread but I >> get an "Program received signal SIGABRT, Aborted." after thread 254 I >> running redhat 7.3 and using boost 1.28.00. Is it an OS problem or a >> boost problem? > > I find it strange that it stopped at 255 threads. Maximum number of > threads in linux is 1024 as defined by PTHREAD_THREADS_MAX in > /usr/include/bits/local_lim.h. With default stacksize you would have > allocated 500M of virtual memory, but I am not too sure if that would > result in thread creation failure. To quote the FAQ I posted a link to in my response: "D.10: My application needs to create thousands of threads, or maybe even more. Can I do this with LinuxThreads? No. You're going to run into several hard limits: * Each thread, from the kernel's standpoint, is one process. Stock Linux kernels (version 2.2 and earlier) are limited to at most 512 processes for the super-user, and half this number for regular users. This can be changed by changing NR_TASKS in include/linux/tasks.h and recompiling the kernel. On the x86 processors at least, architectural constraints seem to limit NR_TASKS to 4090 at most. (It seems that 2.4 kernels have higher limits, though.) * LinuxThreads contains a table of all active threads. This table has room for 1024 threads at most. To increase this limit, you must change PTHREAD_THREADS_MAX in the LinuxThreads/glibc sources and recompile. * By default, each thread reserves 2M of virtual memory space for its stack. This space is just reserved; actual memory is allocated for the stack on demand. But still, on a 32-bit processor, the total virtual memory space available for the stacks is on the order of 1G, meaning that more than 500 threads will have a hard time fitting in. You can overcome this limitation by moving to a 64-bit platform, or by allocating smaller stacks yourself using the setstackaddr attribute. * Finally, the Linux kernel contains many algorithms that run in time proportional to the number of process table entries. Increasing this number drastically will slow down the kernel operations noticeably. (Other POSIX threads libraries have similar limitations, by the way.) For all these reasons, you'd better restructure your application so that it doesn't need more than, say, 100 threads. For instance, in the case of a multithreaded server, instead of creating a new thread for each connection, maintain a fixed-size pool of worker threads that pick incoming connection requests from a queue." I can't begin to explain why PTHREADS_THREADS_MAX is set to 1024 by default, when there's either a 512 or 256 hard limit in the OS by default, but that's not really relevant. It appears he hit the 256 limit on the number of processes allowed for user accounts (since a thread in Linux is actually a process). William E. Kempf 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 http://docs.yahoo.com/info/terms/ 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.

1 0

RE: [Boost-Users] more then 254 threads?
by schalk_cronje＠nai.com 21 Nov '02

21 Nov '02

Eske Christiansen said: > Hej boost-users. > > I'm compiling a test thread program where I create 255 thread but I get > an "Program received signal SIGABRT, Aborted." after thread 254 I > running redhat 7.3 and using boost 1.28.00. Is it an OS problem or a > boost problem? I find it strange that it stopped at 255 threads. Maximum number of threads in linux is 1024 as defined by PTHREAD_THREADS_MAX in /usr/include/bits/local_lim.h. With default stacksize you would have allocated 500M of virtual memory, but I am not too sure if that would result in thread creation failure.

3 2

stupid question
by acarsac 21 Nov '02

21 Nov '02

Hi, Just wondering the difference between library builded with Jam and library builded with specifics target compiler's makefiles. For sample I think about the regex lib under VC6 which gives with nmake -f vc6.mak : boost_regex_vc6_mss.lib boost_regex_vc6_sssd.lib boost_regex_vc6_sssd.pdb boost_regex_vc6_mssd.lib boost_regex_vc6_mssd.pdb boost_regex_vc6_mdid.lib boost_regex_vc6_mdid.dll boost_regex_vc6_mdid.pdb boost_regex_vc6_mdi.lib boost_regex_vc6_mdi.dll boost_regex_vc6_mds.lib boost_regex_vc6_mdsd.lib boost_regex_vc6_mdsd.pdb and Jam that will give us : boost_regex.dll boost_regex.lib boost_regex_debug.dll boost_regex_debug.lib This is because the boost config/*.hpp file does not let me the choice. only the makefiles library seems to work. Thanks in advance. Alex

3 2

bjam
by Chris Southern 21 Nov '02

21 Nov '02

hi, sorry if this is a really dumb question, but is bjam supposed to be useable to build things *with* boost as well as building boost itself? I can't spot the info on how to start that in the Boost.Build docs. Setting the path to the boost headers and the built boost libraries is what I'm stumbling over. TIA ChrisS.

2 1

johnson_all_pairs_shortest_paths() doesn't take my graph
by Ramón Casero Cañas 20 Nov '02

20 Nov '02

Hi, I'm using libbost1.28.0 (the one in Debian Sarge), with gcc version 2.95.4 20011002 (Debian prerelease). I can compile the libs/graph/example/johnson-eg.cpp example, or copy part of it's code to my function dnh.cpp and compile it. But if instead of the adjacency_list graph of the example, I try to pass my own Graph type to johnson's function, I get a large compiling error message. I'm quite new to this, but it seems to me as if the error is caused by the distance matrix, instead of the graph type. The code has some files, and I use a Makefile for the compilation. I thought that maybe the best way of allowing whoever wants to help me to check the error is making a tarball with the involved files. My graph definition is in header file steiner.hpp. steiner_io.hpp and steiner_io.cpp are read/write functions that can be compiled and seem to work well, and should be independent of the error. The compiling error is caused by line 117 of dnh.cpp. If the input variable g (my graph) is substituted by G (libboost example's graph), then the compilation goes fine. The compilation error log is in file "makelog". Regards, Ramón Casero. ---------- /usr/include/boost/graph/graph_concepts.hpp: In method `void boost::BasicMatrixConcept<int[6][6],void *,int>::constraints()': /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::BasicMatrixConcept<int[6][6],void *,int> >(boost::type<boost::BasicMatrixConcept<int[6][6],void *,int> > *)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:66: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/graph_concepts.hpp:449: invalid types `int[6][6][void *]' for array subscript /usr/include/boost/graph/graph_concepts.hpp: In method `void boost::BasicMatrixConcept<int[6][6],void *,int>::const_constraints(const int (&)[6][6])': /usr/include/boost/graph/graph_concepts.hpp:450: instantiated from `boost::BasicMatrixConcept<int[6][6],void *,int>::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::BasicMatrixConcept<int[6][6],void *,int> >(boost::type<boost::BasicMatrixConcept<int[6][6],void *,int> > *)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:66: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/graph_concepts.hpp:454: invalid types `const int[6][6][void *]' for array subscript /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:72: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /usr/include/boost/property_map.hpp: In method `void boost::ReadablePropertyMapConcept<int *,void *>::constraints()': /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::ReadablePropertyMapConcept<int *,void *> >(boost::type<boost::ReadablePropertyMapConcept<int *,void *> > *)' /usr/include/boost/property_map.hpp:209: instantiated from `boost::ReadWritePropertyMapConcept<int *,void *>::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::ReadWritePropertyMapConcept<int *,void *> >(boost::type<boost::ReadWritePropertyMapConcept<int *,void *> > *)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:117: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/property_map.hpp:157: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/property_map.hpp: In method `void boost::WritablePropertyMapConcept<int *,void *>::constraints()': /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::WritablePropertyMapConcept<int *,void *> >(boost::type<boost::WritablePropertyMapConcept<int *,void *> > *)' /usr/include/boost/property_map.hpp:210: instantiated from `boost::ReadWritePropertyMapConcept<int *,void *>::constraints()' /usr/include/boost/concept_check.hpp:46: instantiated from `boost::function_requires<boost::ReadWritePropertyMapConcept<int *,void *> >(boost::type<boost::ReadWritePropertyMapConcept<int *,void *> > *)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:117: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/property_map.hpp:186: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /usr/include/boost/graph/relax.hpp: In function `bool boost::relax<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>)': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:127: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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/bellman_ford_shortest_paths.hpp:127: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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/bellman_ford_shortest_paths.hpp: In function `bool boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int>, boost::bellman_visitor<boost::null_visitor>)': /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:167: instantiated from `boost::detail::bellman_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, int *, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:181: instantiated from `boost::bellman_ford_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, unsigned int, int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, unsigned int, const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:73: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:134: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/graph/bellman_ford_shortest_paths.hpp:134: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:75: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' 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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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/graph/dijkstra_shortest_paths.hpp:201: warning: passing `void *' to argument 2 of `put<int, int>(int *, int, const int &)' lacks a cast /usr/include/boost/graph/relax.hpp: In function `bool boost::relax<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::dummy_property_map, int *, boost::closed_plus<int>, less<int> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::dummy_property_map, 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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >::tree_edge<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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 `boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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:204: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >::tree_edge<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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 `boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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:204: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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/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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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> > >)' /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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >::gray_target<boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> >(boost::detail::edge_desc_impl<boost::undirected_tag,void *>, boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,int *,boost::closed_plus<int>,less<int> >,boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >,boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::dummy_property_map,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::undirectedS,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::property<boost::edge_weight2_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 `boost::dijkstra_shortest_paths_no_init<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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:204: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::dijkstra_visitor<boost::null_visitor>, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, boost::dummy_property_map, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_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::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/dijkstra_shortest_paths.hpp:278: instantiated from `boost::dijkstra_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, boost::edge_weight_t, boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> >(const boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, void *, const boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>,boost::edge_weight_t,boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> > &)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:80: instantiated from `boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: 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 /usr/include/boost/graph/johnson_all_pairs_shortest.hpp: In function `bool boost::detail::johnson_impl<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>, int *, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_edge_property_map<boost::undirected_tag,int,int &,void *,boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight2_t>, int)': /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:112: instantiated from `boost::detail::johnson_dispatch<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t> >(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &, boost::adj_list_edge_property_map<boost::undirected_tag,int,const int &,void *,const boost::property<boost::edge_weight_t,int,boost::property<boost::edge_weight2_t,int,boost::no_property> >,boost::edge_weight_t>, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>,int,const int &,boost::vertex_index_t>)' /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:129: instantiated from `boost::johnson_all_pairs_shortest_paths<boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS>, int[6][6], int *, boost::vertex_distance_t, boost::no_property>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &, int (&)[6][6], const boost::bgl_named_params<int *,boost::vertex_distance_t,boost::no_property> &)' /datos/uni/pfc/c++/dnh.cpp:117: instantiated from `steiner::dnh<WeightType>(boost::adjacency_list<boost::listS,boost::listS,boost::undirectedS,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::property<boost::edge_weight2_t,int,boost::no_property> >,boost::no_property,boost::listS> &)' /datos/uni/pfc/c++/dnh.cpp:50: instantiated from here /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:82: warning: passing `void *' to argument 2 of `get<int>(const int *, int)' lacks a cast /usr/include/boost/graph/johnson_all_pairs_shortest.hpp:82: invalid types `int[6][6][void *]' for array subscript [Non-text portions of this message have been removed]

1 1

more then 254 threads?
by Eske Christiansen 20 Nov '02

20 Nov '02

Hej boost-users. I'm compiling a test thread program where I create 255 thread but I get an "Program received signal SIGABRT, Aborted." after thread 254 I running redhat 7.3 and using boost 1.28.00. Is it an OS problem or a boost problem? yours eske

2 1

[Regex] Maybe bug?
by Yaroslav Govorunov 20 Nov '02

20 Nov '02

Hello, All! For example consider expression: (www\.)?(.+?)\.com When using match algorithm and try to match "www.somesite.com" $1 gets "www.somesite" but I thought it should be "somesite". Why (www\.)? is ignored even when non greedy repeats are used? With best regards, Yaroslav Govorunov, E-mail: slov(a)rsdn.ru http://www.rsdn.ru http://www.isapirewrite.com

2 1

regex+old_include on gcc 3.2
by dreamlax 20 Nov '02

20 Nov '02

Hi all, I am using regex library compiled using gcc 3.2 and with the old_include header files. I wrote this code a year ago. While compiling it gives following error.. /boost/old_include/regex.h:410: `jm_def_alloc' not declared /boost/old_include/regex.h:412: `re_alloc_binder' not declared /boost/old_include/regex.h:443: `jm_def_alloc' not declared any ideas.. thanks sandeep

2 2

FW: Object Lifetime Management with Boost-Python V2
by Daniel Paull 19 Nov '02

19 Nov '02

Hi all, I'm having trouble with some object lifetime issues using Boost Python V2. Basically, I'm in a situation where both C++ and Python want to delete the same object. Below is a simple example of the scenario. Consider the two classes A and B. An instance of A is passed to B via the setA() method. B then assumes ownership of A and deletes it in it's destructor. NOTE: the behaviour of the C++ code can not be changed currently. ------------------------------------- class A { public: A() {} ~A() {} }; class B { public: B() : m_a( 0 ) {} ~B(){ if ( m_a ) delete m_a; } void setA( A* a ){ m_a = a; } private: A* m_a; }; --------------------------------------- I have defined a python module thus, being sure to indicate the pointer adoption by using the with_custodian_and_ward<> policy: --------------------------------------- BOOST_PYTHON_MODULE( my_module ) { class_< A >( "A" ) ; class_< B >( "B" ) .def( "setA", &B::setA, with_custodian_and_ward<1, 2>() ) ; } --------------------------------------- All is fine, and I can show that instances of B keep their instance of A alive. However, executing the python code: -------------- a = A() b = B() b.setA() -------------- results in "a" (or rather, the wrapped C++ object) being deleted twice. I can get around this problem by using a free function "createA()" which returns a new instance of "A" using the "return_existing_object" return value policy, but this seems dangerous and can introduce a memory leak if the user does this from python: -------------- def makeLeak(): a = createA() makeLeak() -------------- Perhaps a new call policy is the solution, but I'm not sure how to proceed. Has anyone solved this problem already? Thanks in advance, Daniel Paull Development Lead Fractal Technologies 57 Havelock Street West Perth WA Australia 6005 PO Box 1675 West Perth WA Australia 6872 Phone: +61 8 9211 6064 Mobile: 0408 921 897 Email: Daniel.Paull(a)fractaltechnologies.com

2 2

Extended use of BGL File Dependency Example
by Tom Matelich 19 Nov '02

19 Nov '02

I was excited to get to use the graph library for a dependency tracking tool we needed, now I have a feature that I don't know how to do. This is mapping library/executable dependencies and we have a lot of apps with common sub-libraries. I'd like to extract a full-rebuild order for only certain nodes, i.e. what libs do I need to build for apps A and B? Since its a DAG, I thought something about reachability, perhaps? I'm not to familiar with graph theory :( thanks, Tom ----------------------------------------------------------------------- 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

condition notify_all problem
by joshuaboelter 19 Nov '02

19 Nov '02

I've just started using the boost libraries, threads so far -- great libraries. I have a test app that uses thread groups of producers and consumers working with a queue. It seems simple enough, but I'm encountering a deadlock problem using notify_all() vs looping with notify_one() when ending the consumer threads. I'm not sure my implementation is correct though (link to source below). I can reliably cause deadlocks on all Windows XP systems I've tried (single, dual and quad machines) within about a minute of execution. However, I only had one deadlock on Windows 2000 (single or quad) in over 6 hours of execution and still going. Attaching or running the executable in the VS7 debugger shows all the threads and the main thread stopped in ntdll.dll via kernel32.dll. The stack shows the last user code executed by wmain was boost::thread_group::join_all from ctg.join_all(). The threads last ran boost::condition::do_wait before entering the kernel. Swapping lines 217-218 for 222-227 appears to fix the deadlock by looping with notify_one(). I would guess that something fundamental is wrong with my implementation, and my fix just changes the timing. Any help is appreciated. The source is posted at the link below. I can provide further information if necessary. Thanks, Joshua Boelter www.boelter.org/data/t_threadgroup.cpp Using Visual Studio 7.0.9466, stlport 4.5.3 (dll), boost libraries 1.29.0 on various WinXP Pro and Win2k systems.

2 2

RE: [Boost-Users] Possible boost addition: sub string and const s tring.
by Jim.Hyslop 19 Nov '02

19 Nov '02

Forwarded to main Boost list - that's the more appropriate venue for discussions of possible additions. -- Jim Hyslop boost-users moderator. > -----Original Message----- > From: alexei_novakov [mailto:alexei_novakov@yahoo.com] > Sent: Monday, November 18, 2002 7:05 PM > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] Possible boost addition: sub string and const > string. > > > Hello everyone. > > I have two classes which I found pretty handy: sub_string (behaves as > a mirror of the portion of master basic_string) and const_string (C- > string wrapper). Nice thing about these two is they implemented as > template specialization of basic_string which has advantages: > a) familiar interface; > b) possibility to reuse the code written for basic_string (like > string streams, lexical casts, etc). > > Any interest? > > Regards. > > Alexei Novakov > > > 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 > http://docs.yahoo.com/info/terms/ > >

1 0

which compiler are you using while using bgl?
by Jun Zhang 19 Nov '02

19 Nov '02

I am a newbie from China, I am sorry about my poor English. I encountered a problem while using bgl. I need your help. and I'd like to know what compiler you are using while using bgl. My Environment: Windows2000 + devc++4.9.6.0(it uses g++ as it's compiler) But it can't compile and run the following example: _________Example start____________ #include <deque> // to store the vertex ordering #include <vector> #include <list> #include <iostream> #include <boost/graph/vector_as_graph.hpp> #include <boost/graph/topological_sort.hpp> int main() { using namespace boost; //create each labels of the tasks const char* tasks[] = { "pick up kids from school", "buy groceries (and snacks)", "get cash at ATM", "drop off kids at soccer practice", "cook dinner", "pick up kids from soccer", "eat dinner"}; const int n_tasks = sizeof(tasks)/sizeof(char*); //create the graph std::vector<std::list<int> >g(n_tasks); g[0].push_back(3); g[1].push_back(3); g[1].push_back(4); g[2].push_back(1); g[3].push_back(5); g[4].push_back(6); g[5].push_back(6); // perform the toplogical sort and output the result std::deque<int> topo_order; topological_sort(g, std::front_inserter(topo_order),vertex_index_map(identity_property_map())); int n = 1; for (std::deque<int>::iterator i = topo_order.begin();i != topo_order.end(); ++i, ++n) std::cout << tasks[*i] << std::endl; system("PAUSE"); } _________Example End_____________ it says: 36 ...\main.cpp instantiated from here I wondered it can compile another example:file_dependencies.cpp, which has also used topological_sort.

4 5

Boost::Threads building ".a" file for MinGW
by ian_ganigan 19 Nov '02

19 Nov '02

Need help ASAP.. I'm new at this. Anyone?

1 0

Possible boost addition: sub string and const string.
by alexei_novakov 19 Nov '02

19 Nov '02

Hello everyone. I have two classes which I found pretty handy: sub_string (behaves as a mirror of the portion of master basic_string) and const_string (C- string wrapper). Nice thing about these two is they implemented as template specialization of basic_string which has advantages: a) familiar interface; b) possibility to reuse the code written for basic_string (like string streams, lexical casts, etc). Any interest? Regards. Alexei Novakov

1 0

Forte 7 Compiler
by ewanbrock 18 Nov '02

18 Nov '02

Hi, I'm trying to compile Boost using the Solaris Forte 7 Compiler. Initial attempts are leading to all sorts of assertion errors. Has anyone had success using boost with this compiler? Does anyone know what the Config options should be ? Many thanks, Ewan

1 0

[BGL] vc6&7 doesn't support partial specialization,can I still use BGL in vc?
by Jun Zhang 18 Nov '02

18 Nov '02

I can't believe it is vc7!! still missing support for partial specialization. Do you know other method to let vc compile BGL codes used partial specialization? Need your help. Jun Zhang

1 0

adjacency_list going out of memory range?
by Ramón Casero Cañas 18 Nov '02

18 Nov '02

Hi, I'm working with GNU/Linux, Debian Sarge, libboost-graph1.28.0, gcc version 2.95.4 20011002 (Debian prerelease). I'm quite new to this, so I don't know if I'll be able to explain my problem correctly. It seems to me as if when I declare a graph, it writes on memory already used by another data structure. The parts of the code that I consider relevant are (.hpp and .cpp merged) ------------------- | | \|/ ------------------- #include <utility> // for std::pair #include <boost/graph/adjacency_list.hpp>/* for namespace boost * vertex_index_t * edge_weight_t * listS * undirectedS */ using namespace boost; 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 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; } namespace steiner { #define EX_FORMAT "not a valid steiner problem file"; } #include <iostream> // for std::cout #include <fstream> // for std::ifstream using namespace steiner; namespace steiner { int readsteinerORfile(steiner::SteinerGraph& g, char *s); } namespace steiner { inline void skipspaces(std::ifstream& fp, char& c); } namespace steiner { inline int readchar2int(std::ifstream& fp, char& c); } /* int main(int argc, char *argv[]) * -------------------------------- * *argv[] (IN): file names array * -------------------------------- * return n: n files were succesfully read, n > 0 * return 0: no files could be read * return -1: unexpected error * -------------------------------- * read steiner problem from files */ int main(int argc, char *argv[]) { ... SteinerGraph g; nf = steiner::readsteinerORfile(g, argv[i]); ... } /* int readsteinerORfile(VertexListGraph& g, char *s) * -------------------------------- * g (OUT): graph read from file * *s (IN): file name * -------------------------------- * return 1: file successfully read * return 0: file could not be read * return -1: unexpected error * -------------------------------- * read steiner problem from one file */ namespace steiner { int readsteinerORfile(steiner::SteinerGraph& g, char *s) { ... int num_edg=0, num_ver=0, // number of edges, vertices num_verw=0; // number of non-steiner vertices char c; // file reader int i; // counter int x; // temp value int *weight_array=NULL; // edge weights read from file Edge *edge_array=NULL; // array of edges read from file int *w_array=NULL; // vertices of W ... weight_array = new int[num_edg]; if (weight_array == NULL) throw (char *)EX_MEM; edge_array = new Edge[num_edg]; if (edge_array == NULL) throw (char *)EX_MEM; w_array = new int[num_verw]; if (w_array == NULL) throw (char *)EX_MEM; ... *************** HERE ******************* /* creation of graph object */ g.clear(); g = SteinerGraph(num_ver); *************** HERE ******************* ... } } ------------------- | | \|/ ------------------- And what happens? If I print the contents of w_array[] at the first "HERE", I get Puf(W(0)=0 )! Puf(W(1)=1 )! Puf(W(2)=2 )! Puf(W(3)=3 )! but if I print them again at the second "HERE", I get Puf(W(0)=8 )! Puf(W(1)=1 )! Puf(W(2)=2 )! Puf(W(3)=-15 )! Does anybody knows what could be happening? Thank you. Regards, Ramón Casero.

2 2

RE: [Boost-Users] Getting a matrix to the power of n
by Scott Sinclair 17 Nov '02

17 Nov '02

Hi Unless I've missed something, I don't think uBlas provides a way to do this (other than the _very_ inefficient prod(A, A) in a loop). If you need to do this frequently with large matrices and/or large powers (n) then you'll need to look at diagonalizing your matrix using eigenvalue/vector decomposition. This reduces your task to raising the values on the diagonal of a diagonal matrix to the power of n and doing two matrix multiplies and an inverse. Finding the eigenvalues and corresponding eigenvectors of your matrix is a non-trivial task which imposes some restrictions on your matrix. Refer to "Numerical recipes in C" by Press et al. for some guidance as well as any good textbook on linear algebra. Hope this helps, Scott > -----Original Message----- > From: agiatojon [mailto:JonAgiato@nyc.rr.com] > Sent: 14/11/2002 14:17 > To: Boost-Users(a)yahoogroups.com > Subject: [Boost-Users] Getting a matrix to the power of n > > > Hello all, > I am working with a formula which requires me to get the result of a > matrix to the power of n (i.e. pow(matrix, n)) but as expected, the > <cmath> function pow() is unable to convert from type double to > matrix. Does the matrix library have this sort of functionality > built in, or maybe some other part of boost? Thanks! > > Jon Agiato > JonAgiato(a)nyc.rr.com 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.

3 2

Using multi_array/matrix to wrap a SAFEARRAY
by Nick Toze 17 Nov '02

17 Nov '02

Hello, I haven't really used C++ much (more Java and Eiffel), but now I am helping develop a C++ dll that will use matrices alot and will probably need to use SAFEARRAY to interface with Visual Basic (either directly or via COM). Also the group I'm in need to standardize on a matrix representation and it needs to be compatible with NAG. I've been trying to wrap a SAFEARRAY using a multi_array and I've got something that seems to work (see attached), but :-) I'm not sure how to go about passing these (i.e. multi_array, multi_array_ref, const_multi_array_ref) around as function arguments since they don't have any inheritance relationship. Do you have any suggestions on that? Maybe template functions could be used, but I'd like to keep my code fairly simple since I'm no expert. As an alternative the uBLAS container classes look very appropriate since I'll only be passing numbers and some of the algorithms could be useful (although I'll mostly be using NAG), but I couldn't quite see whether it is possible to use a uBLAS matrix as a view onto the data in a SAFEARRAY. Is it possible to attach a pointer to an array to a uBLAS matrix? This is the code I've got as an example for wrapping a SAFEARRAY: typedef boost::multi_array_ref<double, 2> dbl_matrix_ref; typedef boost::multi_array<double, 2> dbl_matrix; __declspec(dllexport) HRESULT __stdcall mmultiply(SAFEARRAY** sa1, SAFEARRAY** sa2, SAFEARRAY** result) { HRESULT hr; if ( result == NULL ) return E_INVALIDARG; if ( (*sa1)->cDims != 2 ) return E_INVALIDARG; if ( (*sa1)->cbElements != 8 ) return E_INVALIDARG; if ( (*sa2)->cDims != 2 ) return E_INVALIDARG; if ( (*sa2)->cbElements != 8 ) return E_INVALIDARG; long m1_dim0_sz, m1_dim1_sz, m2_dim0_sz, m2_dim1_sz; m1_dim0_sz = (*sa1)->rgsabound[0].cElements; m1_dim1_sz = (*sa1)->rgsabound[1].cElements; m2_dim0_sz = (*sa2)->rgsabound[0].cElements; m2_dim1_sz = (*sa2)->rgsabound[1].cElements; hr = SafeArrayLock( *sa1 ); if ( FAILED(hr) ) return hr; hr = SafeArrayLock( *sa2 ); if ( FAILED(hr) ) return hr; dbl_matrix_ref matrix1( (double*)(*sa1)->pvData, boost::extents[m1_dim1_sz][m1_dim0_sz], boost::fortran_storage_order() ); dbl_matrix_ref matrix2( (double*)(*sa2)->pvData, boost::extents[m2_dim1_sz][m2_dim0_sz], boost::fortran_storage_order() ); dbl_matrix matrix_result( boost::extents[matrix1.shape()[0]][matrix2.shape()[1]], boost::fortran_storage_order() ); for (dbl_matrix_ref::index i = 0; i != matrix1.shape()[0]; ++i) { for (dbl_matrix_ref::index j = 0; j != matrix2.shape()[1]; ++j) { double s = 0; for (dbl_matrix_ref::index k = 0; k != matrix1.shape()[1]; ++k) { s = s + matrix1[i][k] * matrix2[k][j]; } matrix_result[i][j] = s; } } SAFEARRAYBOUND rgsabound[2]; rgsabound[0].lLbound = 0; rgsabound[0].cElements = matrix_result.shape()[0]; rgsabound[1].lLbound = 0; rgsabound[1].cElements = matrix_result.shape()[1]; SAFEARRAY* lresult = SafeArrayCreate(VT_R8, 2, rgsabound); lresult->pvData = matrix_result.data(); hr = SafeArrayCopy( lresult, result ); if ( FAILED(hr) ) return hr; hr = SafeArrayDestroy( lresult ); if ( FAILED(hr) ) return hr; hr = SafeArrayUnlock( *sa1 ); if ( FAILED(hr) ) return hr; hr = SafeArrayUnlock( *sa2 ); if ( FAILED(hr) ) return hr; return S_OK; } Then I declare this in VBA with: Declare Function mmultiply Lib _ "D:\multiarray_test\Debug\multiarray_test" _ (a() As Double, b() As Double, c() As Double) As Long

2 1

using 'this' with shared_ptrs
by Stephen Crowley 17 Nov '02

17 Nov '02

How is someone supposed to use 'this' when setting a member of another class to point back to it? Here is an example.. when you run it, this will happen. constructor called 0x804af10 constructor called 0x804af48 destructor called 0x804af48 destructor called 0x804af10 destructor called 0x804af10 The last destructor is called twice! The only way I can think to get around this add a member to the class called "shared_ptr<MyClass> thisptr" which is initialized to "this" in the constructor and over-ride the assignment operator or something.. will that work? ------------------------ #include <boost/shared_ptr.hpp> #include <boost/weak_ptr.hpp> #include <iostream> using namespace std; using namespace boost; class MyClass; typedef shared_ptr<MyClass> MyClassPtr; class MyClass { public: MyClass(); ~MyClass(); MyClassPtr makeCopy(); MyClassPtr original; }; MyClass::MyClass() { cout << "constructor called " << this << endl; } MyClass::~MyClass() { cout << "destructor called " << this << endl; } MyClassPtr MyClass::makeCopy() { MyClassPtr mc(new MyClass); mc->original = MyClassPtr(this); return mc; } main() { MyClassPtr oc(new MyClass); MyClassPtr cc = oc->makeCopy(); // the problem lies here // when cc's reference count is 0 it will be deleted, which will // in turn decrease its 'original' reference count which will be 0, thus // causing it to be deleted as well even though it is still being used by oc! cc.reset(); } ----------------------------------- -- Stephen

2 2

Date_time library question...
by shaneforbes 16 Nov '02

16 Nov '02

With the following line in my Microsoft Vc7 program: std::cout << to_simple_string(d) << std::endl; I get the following linker errors: error LNK2005: "public: __thiscall std::locale::id::id(unsigned int)" (??0id@locale@std@@QAE@I@Z) already defined in stdafx.obj error LNK2005: "private: __thiscall type_info::type_info(class type_info const &)" (??0type_info@@AAE@ABV0@@Z) already defined in LIBCD.lib(typinfo.obj) error LNK2005: "private: class type_info & __thiscall type_info::operator=(class type_info const &)" (?? 4type_info@@AAEAAV0@ABV0@@Z) already defined in LIBCD.lib(typinfo.obj) Clearly I am missing something important! I did put #define DATE_TIME_INLINE in my stdafx.h file and that allowed me to create dates (date d(...)) but clearly something else is needed (for IO related stuff?)... Do I have to for instance recreate the libboost_date_time.lib file with different settings? I just used 'bjam "-sTOOLS=vc7" "- sBUILD=debug release"'. Any help appreciated. Thanks to Jeff Garland and the rest of the Boost group for creating this library - I would really like to use it in my programs from now on but why won't the silly linker oblige!

2 8

Codewarrior 8 and Include Paths
by Roland Weiss 15 Nov '02

15 Nov '02

Hello, I'm trying to compile some simple test programs that use Boost Header libraries (no building required), like any, shared_ptr etc. Using CW8, I have a strange problem. When I add the Boost root to the access path, the compiler finds the according boost headers, but inside the config header the Boost lib looks up some headers using this syntax: #include <user.hpp> and so on. CW8 then fails to find these headers. If I change <user.hpp> to "user.hpp" all works fine (but it fails on the next header in angle brackets). Any help appreciated. Roland

2 2

uBlass outer_product
by Olaf Petzold 15 Nov '02

15 Nov '02

Hi, I can't get the following snipped from the doc examples to work: #include <iostream> #include <boost/numeric/ublas/vector.hpp> #include <boost/numeric/ublas/io.hpp> int main () { using namespace boost::numeric::ublas; vector<double> v1 (3), v2 (3); for (int i = 0; i < std::min (v1.size (), v2.size ()); ++ i) v1 (i) = v2 (i) = i; std::cout << outer_prod (v1, v2) << std::endl; } ublas_cross.cc: In function `int main()': ublas_cross.cc:17: `outer_prod' undeclared (first use this function) ublas_cross.cc:17: (Each undeclared identifier is reported only once for each function it appears in.) What's wrong here? Thanks Olaf

2 1

RE: [Boost-Users] using 'this' with shared_ptrs
by Per Kristensen 15 Nov '02

15 Nov '02

You initialises two shared_ptr with the same raw pointer. As a consequent the destructor is called twice, as you will have two different shared_count object which will calls delete as the count become zero. Try to use weak_ptr as a member: ----------------------------------- typedef shared_ptr<MyClass> MyClassPtr; class MyClass { public: MyClass(); ~MyClass(); void setOriginal(MyClassPtr); MyClassPtr makeCopy(); weak_ptr<MyClass> original; }; MyClass::MyClass() { cout << "constructor called " << this << endl; } MyClass::~MyClass() { cout << "destructor called " << this << endl; } void MyClass::setOriginal(MyClassPtr p) { original = p; } MyClassPtr MyClass::makeCopy() { return MyClassPtr(original); } main() { MyClassPtr oc(new MyClass); oc->setOriginal(oc); MyClassPtr cc = oc->makeCopy(); } --------------------------------- Per -----Original Message----- From: Stephen Crowley [mailto:stephenc@digitalpassage.com] Sent: 15. november 2002 05:37 To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] using 'this' with shared_ptrs How is someone supposed to use 'this' when setting a member of another class to point back to it? Here is an example.. when you run it, this will happen. constructor called 0x804af10 constructor called 0x804af48 destructor called 0x804af48 destructor called 0x804af10 destructor called 0x804af10 The last destructor is called twice! The only way I can think to get around this add a member to the class called "shared_ptr<MyClass> thisptr" which is initialized to "this" in the constructor and over-ride the assignment operator or something.. will that work? ------------------------ #include <boost/shared_ptr.hpp> #include <boost/weak_ptr.hpp> #include <iostream> using namespace std; using namespace boost; class MyClass; typedef shared_ptr<MyClass> MyClassPtr; class MyClass { public: MyClass(); ~MyClass(); MyClassPtr makeCopy(); MyClassPtr original; }; MyClass::MyClass() { cout << "constructor called " << this << endl; } MyClass::~MyClass() { cout << "destructor called " << this << endl; } MyClassPtr MyClass::makeCopy() { MyClassPtr mc(new MyClass); mc->original = MyClassPtr(this); return mc; } main() { MyClassPtr oc(new MyClass); MyClassPtr cc = oc->makeCopy(); // the problem lies here // when cc's reference count is 0 it will be deleted, which will // in turn decrease its 'original' reference count which will be 0, thus // causing it to be deleted as well even though it is still being used by oc! cc.reset(); } ----------------------------------- -- Stephen 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 <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

1 0