- Boost-users - lists.boost.org

[BGL] johnson_all_pairs_shortest problem compiling
by Val Samko 04 Apr '04

04 Apr '04

Hi, Why doesn't the following code compile (VC++ 7.1, g++ 3.3.3, boost 1.31.0) ? ======================================================================== #include <boost/graph/adjacency_list.hpp> #include <boost/graph/johnson_all_pairs_shortest.hpp> int main() { using namespace boost; typedef adjacency_list<vecS, vecS, bidirectionalS, boost::property<boost::vertex_index_t, int, boost::property<boost::edge_weight_t, int> > > Graph; Graph g; int distance_matrix[100][100]; johnson_all_pairs_shortest_paths(g, distance_matrix); } ======================================================================== but it compiles, if we pass the edge weight map (composed from std::map<edge_descriptor, int>) as a named parameter to johnson_all_pairs_shortest_paths ? Also, why do johnson_all_pairs_shortest_paths(g, distance_matrix); and johnson_all_pairs_shortest_paths(g, distance_matrix, weight_map(get(vertex_index, g))); produce completely different compile time errors? Finally, is it possible to use johnson_all_pairs_shortest_paths with adjacency_list<mapS, mapS, ...> ? According to the documentation, this should be possible, but this just does not compile. -- Val Samko http://val.digiways.com/

2 2

[BGL] documentation problem
by Val Samko 04 Apr '04

04 Apr '04

Hi, Is it required for a readable property map to have operator[]? At least, that is not mentioned at http://www.boost.org/libs/property_map/ReadablePropertyMap.html , so I assume, operator[] is not required. At http://www.boost.org/libs/graph/doc/johnson_all_pairs_shortest.html it is documented that weight_map named parameter must be a model of a readable property map. At johnson_all_pairs_shortest.hpp, line 101 we have w[e2] = w1[*e]; which assumes that weight_map has operator []. Is the problem in the readable property map documentation, or in the johnson_all_pairs_shortest, or I am doing something wrong? -- Val Samko http://val.digiways.com

2 2

RE: [Boost-users] Re: about license
by Darryl Green 04 Apr '04

04 Apr '04

> -----Original Message----- > From: David Abrahams [mailto:dave@boost-consulting.com] > Sent: Tuesday, 2 March 2004 12:43 AM > > "Darryl Green" <Darryl.Green(a)unitab.com.au> writes: > > > I'm happy to provide a patch once I'm reasonably sure I > understand the > > license. I'm assuming an email discussion will be more > productive than > > patches in the meantime. I have one more question that I > have a proposed > > FAQ answer for, but my "answer" is based purely on what I think it > > should be, not an understanding of the law. I've been trying to educate myself about the law in this area, with some help from Alexander Terekhov. I'm not at all convinced now that there is any derivative work produced by the compilation step, however this seems to make no difference to the result. It seems the compiled code is a translation of both works, agregated (a compilation) in some way then. I think whoever produces the compilation can license it however they like, subject to permission being granted by the authors of the original works to include their work in the compilation. I don't know if this is sufficiently clearly allowed by the wording of the boost license, though I think "use" must surely allow this for software source libs as there is no other way to "use" them. So the final answer is the same - but some of the questions and answers in between may be wrong. Have you received any feedback from lawyers about this? Regards Darryl Green. ########################################################################## This e-mail is for the use of the intended recipient(s) only. If you have received this e-mail in error, please notify the sender immediately and then delete it. If you are not the intended recipient, you must not use, disclose or distribute this e-mail without the author's prior permission. We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. ##########################################################################

2 1

[BGL] truncating dijkstra_shortest_paths
by Sven de Vries 03 Apr '04

03 Apr '04

Hi, in a given graph I want to determine whether between one (!) pair (u,v) of vertices there exists an u-v-path of length at most some given threshold and that path. I use dijkstra_shortest_paths(g,u, but to accelerate matters I would like to stop the computation as soon as the key of v becomes smaller than the threshold or v turns black. I couldn't find a hook of the dijkstra algorithm that could be used to achieve this. Do I really have to change the implementation of the dijkstra algorithm for this, or is there a better way? Thanks sven

2 1

how to package graph related data ???
by Gustavo Sánchez 02 Apr '04

02 Apr '04

Hi all, I'm developing a hardware test program with some class abstractions like resistor, diode, relay ... which I stick to the BGL graph structure in the edge properties. I so have some information associated with vertices, and the result is a set of data composed of the graph itself - an ajacency_list - the graph properties for edges and vertices and a couple of vectors for the abstractions. My problem is how can I manage all these data in an OO program. The method used in BGL examples (just declare all these in main ) is right just for that, but in a more complex object colaboration society I consider it to be simple and useless. I just use a class named GraphContainer to package all the elements, but I wonder if there is any other better aproach... class GraphContainer{ int nVertices; public: UGraph g; property_map<UGraph, vertex_index_t>::type id; property_map<UGraph, edge_name_t>::type name; property_map<UGraph, vertex_name_t>::type vname; std::map<string,boost::graph_traits<UGraph>::vertex_descriptor> vertx; // mapa vertices(string)--vertex_descriptor vector<Lampara> Lamparas; vector<Diodo> Diodos; vector<Switch> Switches; vector<Resistencia> Resistencias; vector<Bobina> Bobinas; // ---------- GraphContainer(); }; Thanks a lot... --------------------------------- Antivirus Filtros antispam 6 MB gratis ¿Todavía no tienes un correo inteligente?

1 0

Re: [boost] [BGL] forced client complexity
by Jeremy Siek 02 Apr '04

02 Apr '04

Hi, I too am dissatisfied with the complexity of many parts of the BGL... On Mar 31, 2004, at 4:48 AM, Provisional Dissonance wrote: > Is there any particular reason that a > simplified interface is not made available? Just a lack of time. The priority was placed on providing flexibility and efficiency so that the BGL components could handle any situation... that flexibility came at the price of complexity. I think a good next step would be to provide more special purpose components that are easier to use. > Perhaps a > container adapter could be packaged with the library > allowing a compromise of functionality and flexibility > for simplicity? Could you explain this "container adaptor" idea more. > #include <less_than_10_graph_headers> > ... > digraph<some_node_type,some_edge_context_type> g; > g << "vertex" << make_pair("vertex", > "implicit_vertex"); > g.add_edge("brother", "sister", "sibling"); > if(g.find(make_pair("brother", "sister"))) > related = true; Perhaps this is a good place to start. Could you explain each of the above lines of code. Then we can compare to an implementation in the current BGL and pinpoint problem areas. Cheers, Jeremy _______________________________________________ Jeremy Siek <jsiek(a)osl.iu.edu> http://www.osl.iu.edu/~jsiek Ph.D. Student, Indiana University Bloomington Graduating in August 2004 and looking for work C++ Booster (http://www.boost.org) _______________________________________________

3 6

multi_array iterator question
by James N. Knight 02 Apr '04

02 Apr '04

I am trying to sort a multi_array along a dimension that is not the last. In other words, I can sort the rows of a 2D multi_array like so: typedef boost::multi_array<double, 2> array_type; typedef array_type::iterator iterator2; typedef array_type::template subarray<1>::type::iterator iterator1; array_type A(boost::extents[10][10]); for (iterator2 i = A.begin(); i!=A.end(); ++i){ sort((*i).begin(),(*i).end()); What I can't seem to do is sort the columns. Is there a way I can create a view with the dimensions reordered? Or, can I somehow create a strided iterator that will do the job (select the values in a column)? I would like to avoid transposing the array. Pointers to the relevant documentation or suggestions are appreciated. James

1 0

Boost.Test support address
by Gennadiy Rozental 02 Apr '04

02 Apr '04

For anyone interrested, direct support address for Boost.Test issues is now rogeeff(a)patmedia.com. Old one is not free anymore and not supported accordingly. Regards, Gennadiy.

1 0

linker error creating simple unit_test (boost 1.31.0 + win32 + vc 71)
by Langston, Matthew David 02 Apr '04

02 Apr '04

I'm trying to create a simple unit test (using the Unit Test Framework) using boost 1.31.0 + win32 + vc71, but I get the following linker error due to the undefined symbol __imp___CrtSetReportHook: tests error LNK2019: unresolved external symbol __imp___CrtSetReportHook referenced in function "public: int __thiscall boost::execution_monitor::execute(bool,int)" (?execute@execution_monitor@boost@@QAEH_NH@Z) There was mention of this undefined symbol (__imp___CrtSetReportHook) in this thread: http://lists.boost.org/MailArchives/boost/msg43787.php. However, that post was concerning the Metrowerks compiler, but I am using Microsoft's vc71 compiler. Can someone help me resolve this undefined symbol (__imp___CrtSetReportHook) problem? Here is my simple "unit test suite" that I am trying to build: #include <boost/test/unit_test.hpp> #include <boost/test/included/unit_test_framework.hpp> using boost::unit_test_framework::test_suite; void test_GleamData() { BOOST_CHECK(2 == 1); // non-critical test => continue after failure } test_suite* init_unit_test_suite( int, char* [] ) { test_suite* test = BOOST_TEST_SUITE( "GleamAnalysis Test Suite" ); test -> add( BOOST_TEST_CASE( &test_GleamData ), 1 /* expected one error */ ); return test; } Warmest regards, Matt

2 1

RE: [Boost-users] Re: License compatibility issues.
by Jim.Hyslop 01 Apr '04

01 Apr '04

David Abrahams wrote: > It seems to me that we can't ask > our volunteer lawyers to draw up a list of answers to all the possible > licensing questions along these lines, nor can we reasonably make them > available as an on-demand resource for answering boost users' legal > questions. No, but I think that the interaction between the LGPL or GPL and the Boost License is probably going to be a very frequently encountered scenario. Basically, what it boils down to is: what is the compatibility between LGPL or GPL, and the Boost license? Can we draw up a list of the most common free-software licenses, say the top three, and ask the volunteer lawyers to determine whether Boost is compatible with each of the three? I don't mean to determine the various combinations and permutations, e.g. Boost and GPL and Mozilla Artistic, but the simple ones: Boost and "x", Boost and "y", etc. Until and unless such a comparison is done, though, I would echo your advice about seeking a competent legal opinion. -- Jim Hyslop Senior Software Designer Leitch Technology International Inc. (http://www.leitch.com) Columnist, C/C++ Users Journal (http://www.cuj.com/experts)

2 1