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

newbie:BoostGraphLibrary - brandes_betweenness -> closenness
by Ioannis Filippis 21 Jul '06

21 Jul '06

Hi all, I wonder whether it is possible to calculate the closenness centrality using the brandes_betweenness_centrality. The closeness centrality of a vertex is defined by the inverse of the average length of the shortest paths to/from all the other vertices in the graph. I know that in theory this is possible and it would actually save a lot of time if someone wants to calculate both properties. Currently I am running brandes_betweenness like this brandes_betweenness_centrality(g, get(&VertexInfo::betweenness, g), get(&EdgeInfo::betweenness, g)); I prefer bundled properties as for me are more clear in concept. I wonder whether: a.I could use Util parameters like DistanceMap to calculate closenness. However, I can not really understand how I can create an iterator_property_map using bundled properties. OR b.I have to modify the brandes_betweenness_centrality to calculate also closenness. I apologise in case the answer to my problem is trivial but I am just newbie in the Boost Graph Library. Thanks for your help. Ioannis

1 0

BGL serialization
by Camilo Melani 21 Jul '06

21 Jul '06

Hello, I'd like to save and restore a adjacency_list graph in a XML file, Does anyone has some example code or can help me? I can serialize std::map and others classes, but when I try to serialize the graph I get compiler errors. Thank for the help!! Camilo Some part of the code: #include <boost/config.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/adj_list_serialize.hpp> #include <boost/dynamic_bitset.hpp> #include <boost/archive/xml_iarchive.hpp> #include <boost/serialization/map.hpp> typedef adjacency_list< vecS, vecS, bidirectionalS, no_property, no_property > Graph; template<class Archive> void serialize(Archive & ar, const unsigned int version) { ar & BOOST_SERIALIZATION_NVP(graph); } Error!!! C:\Boost\include\boost-1_35\boost/archive/basic_xml_oarchive.hpp(86) : error C2664: 'boost::mpl::assertion_failed' : cannot convert parameter 1 from 'boost::mpl::failed ************boost::serialization::is_wrapper<T>::* ***********' to 'boost::mpl::assert<false>::type' with [ T=boost::no_property ] No constructor could take the source type, or constructor overload resolution was ambiguous __________________________________________________ Preguntá. Respondé. Descubrí. Todo lo que querías saber, y lo que ni imaginabas, está en Yahoo! Respuestas (Beta). ¡Probalo ya! http://www.yahoo.com.ar/respuestas

1 0

Re: [Boost-users] [Serialization] Problem serializing via baseclassptr
by Guy Létourneau 21 Jul '06

21 Jul '06

Any updates on my problem Robert? Thanks, Guy > >Robert, > >I've created a simple test as you suggested. The problem is that the test >does not even build (in oserializer.hpp, there are 2 conditions for this to >happen but none seems to match my test..). Here's what the compiler gives >me: > >C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp: In >function `void boost::archive::save(Archive&, T&) [with Archive = >boost::archive::text_oarchive, T = A]': >C:/Boost/include/boost-1_33_1/boost/archive/basic_text_oarchive.hpp:78: >instantiated from `void >boost::archive::basic_text_oarchive<Archive>::save_override(T&, int) [with >T = A, Archive = boost::archive::text_oarchive]' >1_33_1/boost/archive/detail/interface_oarchive.hpp:78: instantiated from >`Archive& >boost::archive::detail::interface_oarchive<Archive>::operator<<(T&) [with T >= A, Archive = boost::archive::text_oarchive]' >../main.cpp:90: instantiated from here >C:/Boost/include/boost-1_33_1/boost/archive/detail/oserializer.hpp:567: >error: incomplete type `boost::STATIC_ASSERTION_FAILURE<false>' does not >have member `value' >#include <iostream> >#include <fstream> >#include <boost/archive/text_oarchive.hpp> >#include <boost/archive/text_iarchive.hpp> >#include <boost/serialization/export.hpp> > >class A >{ > public: > > A() > { > i = 1; > }; > > virtual ~A() > { > }; > > virtual void Dummy() = 0; > > private: > > int i; >}; >BOOST_IS_ABSTRACT(A) > >class B : public A >{ > public: > > B() > { > }; > > virtual ~B() > { > }; > > void Dummy() > { > }; > > void SetValue( std::string& value ) > { > Data = value; > } > > private: > > friend > class boost::serialization::access; > > template <class Archive> > void serialize( Archive& ar, const unsigned int version ) > { > ar & boost::serialization::base_object<A>( *this ); > ar& Data; > std::cout << "Serialization of B" << std::endl; > std::cout.flush(); > } > > std::string Data; >}; >BOOST_CLASS_EXPORT(B); >int main() >{ > // Create a B object > B* Child = new B; > > // Set some data > std::string Data = "test"; > Child->SetValue( Data ); > > // Assign it to a A ptr > A* Parent = Child; > > // create and open a character archive for output > std::ofstream ofs( "filename" ); > > // save data to archive > { > try > { > boost::archive::text_oarchive oa( ofs ); > // write class instance to archive > oa << *Parent; > } > catch( boost::archive::archive_exception& e ) > { > std::cout << "Save failed! : " << e.what(); > std::cout.flush(); > > return false; > } > catch( ... ) > { > std::cerr << "Unknown Exception " << std::endl; > > return false; > } > > // archive and stream closed when destructors are called > } > > delete Child; >} > >The example is very simple. Again, I have problems only when serializing >via a base class ptr (serializing object "directly" works fine). > >Thanks again for your help, > >Guy >Hmm - looks like it should work to me. > >I would try the following: > >a) make a tiny test - a main which which does nothing but tests the >serialization. >This you can ship to us in necessary. >b) For now - remove all the BOOST_CLASS_TRACKING macros. >It shouldn't make a difference but let's start simple. >c) You'll have to add BOOST_CLASS_EXPORT for SomeData >d) double check that everything is in the same namespace. >e) try removing the friend class boost::serialization::access; from >the base class. NonVolatileData::serialize(..) should never be called >by the serialization library in this case - so if this traps during >compile, >it will show a chain of "compile time calls". By looking at this chain >one can see where things went wrong. Unfortunately this requires >looking at the header source code - oh well. >f) double check that the test corresponding to your example builds >and runs in your environment. If that passes, but yours does not, try >modifying the test bit by bit by commenting out the code that is there >and replacing it with your own code. If you finish this and the test >still works - then just remove all the commented code and you'll be >done. > >Robert Ramey Guy Létourneau wrote: > Robert, > I've tried to include your changes but it doesn't solve the problem. > I had to add the following line: BOOST_IS_ABSTRACT(NonVolatileData) > for the program to compile. I agree with you, to have an abstract > class is what is needed in that case as the NonVolatileData class is > not intended to do something useful except for allowing my data > storage layer to be generic. However, abstract or not, I still have > the same problem: when serializing my SomeData object through a > pointer to the NonVolatileData, only the data of the parent class > gets serialized. Anything else you want me to try? > > Thanks, > Guy > >> Try making the base class polymorphic - that it define at least >> one abstract function. See my changes below. This will have >> the beneficial effect of inhibiting anyone from creating an instance >> of your base class directly. >> Robert Ramey > >> Guy Létourneau wrote: >>> Hello, >>> >>> I need to develop a generic data storage layer. Its job is to handle >>> the serialization of all objects that need to be persistent in my >>> system and handle management of archives, backups and restores and >>> so forth. The most important point is that it must stay generic, >>> i.e. have no knowledge of the type of objects being passed by other >>> modules in the system. Because of this, I define a base class >>> NonVolatileData from which all data classes in the system will >>> derive: >>> >>> /////////////////////////////////////////////////////////////////////// >>> // Base class >>> class NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> NonVolatileData(){ i = 1; }; >>> virtual ~NonVolatileData() = 0; // Note - pure virtual function >>> make class abstract- >>> >>> >>> protected: >>> >>> virtual void Dummy() =0; // Note - pure virtual function make >>> class abstract- >> ; >>> >>> int i; >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & i; >>> } >>> }; >>> BOOST_CLASS_TRACKING(NonVolatileData, >>> boost::serialization::track_never) >>> >>> >>> class SomeData: public NonVolatileData >>> { >>> friend >>> class boost::serialization::access; >>> >>> public: >>> >>> SomeData () >>> { >>> }; >>> >>> ~SomeData () >>> { >>> }; >>> >>> void SetValue( std::string& Address ) >>> { >>> this->Address = Address; >>> } >>> >>> void Dummy() >>> { >>> } >>> >>> private: >>> >>> template <class Archive> >>> void serialize( Archive& ar, const unsigned int version ) >>> { >>> ar & >>> >>> boost::serialization::base_object<NonVolatileData>(*this); >>> ar& Address; } >>> >>> std::string Address; >>> }; >>> BOOST_CLASS_TRACKING(SomeData, boost::serialization::track_never) >>> ///////////////////////////////////////////////////////////////// >>> >>> My data storage interface will take a ptr to the base class i.e. >>> Save(NonVolatileData* data) so the serialization will be performed >>> through a ptr to the base class. I've read the documentation >>> multiple times and I'm still unable to make that work correctly. >>> When a do a save, only the base class is serialized even though the >>> base class is polymorphic. I've tried using the >>> BOOST_CLASS_EXPORT_GUID macro the force a registration of my derived >>> class without success. I've also checked the example from demo.cpp. >>> It uses the direct call to register_type() but in my case, I don't >>> want to change the code everytime a new class is defined in the >>> system so I went with option 2 (the macro). There's probably a >>> subtle detail I do not do correctly (polite way of saying I'm >>> missing something :-)). >>> >>> Thanks for your help, >>> >>> Guy Letourneau =

1 0

Re: [Boost-users] [serialization] Skipping unexpected elements in XMLarchive
by Todd Greer 21 Jul '06

21 Jul '06

Peter wrote: > The additional need I'm trying to solve is that the XML elements can be > reordered, i.e. come in a different order than the serialization lib > expects them. You could store whatever XML elements you skip. Then, every time you get a request to read something, first check the stored XML. You would need to have a stack of storage locations to correspond to how deep you are in the XML hierarchy and discard the XML elements on the top of the stack when you parse an end tag. I think that would work, as long as you don't mind having to buffer some XML. Another approach would be to store pointers to the variables that are passed into the serialization library, rather than storing the XML. Then, when reading an XML open tag, look in your set of stored pointers for a match and deserialize into it. I'm not sure whether or not this could be made to work with the current Serialization library. Basically, to support reordering, you need to buffer one side or the other. Buffering the XML would probably work better with the current Serialization library, but would be less efficient. HTH, Todd Greer <tgreer <at> affinegy dot com> Senior Software Developer, Affinegy LLC

1 0

Re: [Boost-users] [python], [regex] Segmentation fault when deallocating match_results in a python extension module
by bernhard.maeder＠zkb.ch 21 Jul '06

21 Jul '06

Arrr, I've now compiled the example on different machines (Windows, MacOS) and it seems I'm only getting into troubles on my target system (Debian)... I've used ldd to get the library dependencies of my extension modules; the difference between building with gcc3.3 and gcc3.4 is with the libstdc++, which is used in version 5 and 6, respectively. But since python doesn't use this library, this should make no difference at all. Is there anything else I could possibly try? Thanks Bernhard "John Maddock" <john(a)johnmaddock.co.uk> Gesendet von: boost-users-bounces(a)lists.boost.org 19.07.2006 13:53 Bitte antworten an boost-users An: <boost-users(a)lists.boost.org> Kopie: Thema: Re: [Boost-users] [python], [regex] Segmentation fault when deallocating match_results in a python extension module bernhard.maeder(a)zkb.ch wrote: >> Hello everybody >> The program aborts when exiting test_func(), during deallocation of >> match_results. The error occurs somewhere in _M_deallocate of >> stl_vector.h. >> >> Can anybody help me with this problem? What could possibly go wrong >> here? In theory not much :-( >> One thing I noted: python is compiled using GCC3.3 on our system, >> while we are using GCC3.4, is this a problem? (But, trying the same >> on a system with GCC 4 for both, python and our app, also fails, so >> it seems like the problem is to be sought elsewhere). It does sound like the std::vector is allocating with one one allocator and deallocating with another. But I know nothing about python extension modules and what can go wrong there. John. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

File Manipulation
by Simon Reye 21 Jul '06

21 Jul '06

I've had a look through the iostream stuff but my head can't think straight this late in the week. I require two things: 1. The ability to truncate and grow a file. I see the seek/write functions which I'm guessing will take care of my growth needs but what about truncation? 2. The ability to memory map a file. I saw mapped_file which I guess is the one. Simon

3 10

Re: [Boost-users] Valid arguments for boost::math::gcd()
by james.jones＠firstinvestors.com 20 Jul '06

20 Jul '06

From: "Matthias Hofmann" <hofmann(a)anvil-soft.com> > Also, I would like to know how the greatest common divisor is defined when > one or both of the arguments are zero. In that case, boost::math::gcd() > seems to return the nonzero argument, if there is any - but is this > mathematically correct? Yes, it's correct. gcd(a,b) is the greatest integer n such that n|a and n|b. Every integer n has the property that n|0, so gcd(a,0) = a. - James Jones Administrative Data Mgmt. Webmaster 375 Raritan Center Pkwy, Suite A Data Architect Edison, NJ 08837

2 1

[endian] Endian types in union
by Dave Dribin 20 Jul '06

20 Jul '06

Hello, This may be more appropriate for the devel list, but someone just pointed out on this list that an endian library has been submitted for approval. I've *just* needed classes like this (actually I wrote my own similar classes), and decided to see how the Boost library stacked up. It looks quite nice, and I'd be excited to see this included. One suggestion I would make is that the endian classes should not have constructors. As of version 0.5, trying to put them into a union causes a compiler error. Take the struct from the example, and add a union: struct header { big4_t file_code; big4_t file_length; little4_t version; little4_t shape_type; union { big4_t foo; little4_t bar; } baz; }; I get the following errors: endian_example.cpp:37: error: member 'boost::integer::big4_t <unnamed>::header::<anonymous union>::foo' with constructor not allowed in union endian_example.cpp:38: error: member 'boost::integer::little4_t <unnamed>::header::<anonymous union>::bar' with constructor not allowed in union By removing all constructors, the errors go away. I cam across this very issue when developing my classes, and found the answer in this comp.lang.c++.moderated post: <http://groups.google.com/group/comp.lang.c++.moderated/msg/ 103835a7b493723e?hl=en&> As an experiment, I modified boost/integer/endian.hpp to remove the constructors, and add an operator=() to see if this worked, and it did: template <typename T, std::size_t n_bytes> class endian< big, T, n_bytes, unaligned > : cover_operators< endian< big, T, n_bytes >, T > { public: typedef T value_type; operator T() const { return detail::load_big_endian<T, n_bytes>(bytes); } void operator=(T i) { detail::store_big_endian<T, n_bytes> (bytes, i); } private: char bytes[n_bytes]; }; I'd suggest making this change to all classes so that they can be used in unions. -Dave

2 7

boost::minmax_element 2D points bounding box
by Tomas Rapkauskas 20 Jul '06

20 Jul '06

Hello, I am newbie using boost library. I have tried to use boost::minmax_element to calculate bounding box of 2D Points, but I failed... Here is some code: struct S2DPoint { int x; int y; }; typedef std::vector<S2DPoint > Poly; Poly vect; ... std::pair<iterator, iterator> result = boost::minmax_element(poly.begin(), poly.end()); this code does not compiles I need to define BinaryPredicate.. My code with out boost looks: bool CalcPolyMinMax(const S2DPoint poly[], int nCount, S2DPoint &ptMin, S2DPoint &ptMax) { if ( nCount < 1 ) { return false; } ptMin = poly[0]; ptMax = poly[0]; S2DPoint pt; for ( int i1 = 0; i1 < nCount; ++i1 ) { pt = poly[i1]; UpdateMinMaxPoints(ptMin, ptMax, pt); } return true; } void UpdateMinMaxPoints(S2DPoint &ptMin, S2DPoint &ptMax, const S2DPoint &pt) { if ( ptMin.x > pt.x ) { ptMin.x = pt.x; } if ( ptMax.x < pt.x ) { ptMax.x = pt.x; } if ( ptMin.y > pt.y ) { ptMin.y = pt.y; } if ( ptMax.y < pt.y ) { ptMax.y = pt.y; } } Question: How to transform UpdateMinMaxPoints function to the BinaryPredicate? Thanks, Tomas

2 1

Valid arguments for boost::math::gcd()
by Matthias Hofmann 20 Jul '06

20 Jul '06

Hello everybody, I just learned that boost offers a function to determine the greatest common divisor of two integers, as described here: http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_math/g reatest_common_divisor_and_least_common_multiple.html However, this documentation is not very clear about which arguments are valid for boost::math::gcd(). In particular, it does not specify that the first argument has to be greater than the second one, although this seems to be a requirement with the current implementation. Also, I would like to know how the greatest common divisor is defined when one or both of the arguments are zero. In that case, boost::math::gcd() seems to return the nonzero argument, if there is any - but is this mathematically correct? -- Matthias Hofmann Anvil-Soft, CEO http://www.anvil-soft.com - The Creators of Toilet Tycoon http://www.anvil-soft.de - Die Macher des Klomanagers

1 0