Hi, I compiled this program: transitive_closure_test.cpp with: g++ -ftemplate-depth-30 -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ transitive_closure_test.cpp then I run: Created graph with 13 vertices. transitive_closure Segmentation fault (core dumped) Exit 139 What can I do in this case? Thank you, Janos
Hi Janos,
On 12/14/01 8:46 AM, "Janos Murvai"
You already did the right thing, sent email to the Boost-Users list ;) Thanks for the bug report! I've fixed the bug, and checked the fix into the sourceforge Boost cvs. Cheers, Jeremy -- Jeremy Siek http://www.osl.iu.edu/~jsiek Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608
Hi Jeremy,
My plan to use your graph library intesively on larger graphs because your approach is very good :). Therefore I test the programs first and report it if I find bug or just I don't know something. Thank you your help. Janos
Hi, I tried other programs: g++ -ftemplate-depth-30 -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ bfs_cc.cpp Then the program (a.out) run more than 1 minutes and didn't stop. (I killed..) is it ok? other two program: dfs_cc.cpp dijkstra_cc.cpp similar but e.g. dfs.cpp bfs.cpp are ready, immeadiately finished. Other things: When I compiled g++ -ftemplate-depth-30 -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ leda_graph_cc.cpp I got: In file included from leda_graph_cc.cpp:26: /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/leda_graph.hpp:33: LEDA/graph.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/leda_graph.hpp:34: LEDA/node_array.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/leda_graph.hpp:35: LEDA/node_map.h: No such file or directory Exit 1 When I compiled g++ -ftemplate-depth-30 -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ stanford_graph_cc.cpp I got: In file included from stanford_graph_cc.cpp:27: /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:54: gb_graph.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:55: gb_io.h: No such file or di rectory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:56: gb_flip.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:57: gb_dijk.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:58: gb_basic.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:62: gb_books.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:63: gb_econ.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:64: gb_games.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:65: gb_gates.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:68: gb_lisa.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:69: gb_miles.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:70: gb_plane.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:71: gb_raman.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:72: gb_rand.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:73: gb_roget.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:74: gb_save.h: No such file or directory /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:75: gb_words.h: No such file or directory Exit 1 Janos
Hi Janos, The *_cc.cpp programs are not meant to be executed. They are "concept checking" programs meant to catch compile-time problems. See the following URL for more information about concept checking: http://www.boost.org/libs/concept_check/concept_check.htm Cheers, Jeremy On Fri, 14 Dec 2001, Janos Murvai wrote: murvai> murvai> Hi, murvai> murvai> I tried other programs: murvai> murvai> g++ -ftemplate-depth-30 -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ bfs_cc.cpp murvai> murvai> Then the program (a.out) run more than 1 minutes and didn't stop. (I murvai> killed..) is it ok? murvai> murvai> other two program: dfs_cc.cpp dijkstra_cc.cpp ---------------------------------------------------------------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ----------------------------------------------------------------------
For the LEDA stuff to work you must have LEDA installed. Don't worry about this if you don't already use LEDA graphs. On Fri, 14 Dec 2001, Janos Murvai wrote: murvai> I got: murvai> In file included from leda_graph_cc.cpp:26: murvai> /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/leda_graph.hpp:33: murvai> LEDA/graph.h: No such file murvai> or directory murvai> /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/leda_graph.hpp:34: murvai> LEDA/node_array.h: No such murvai> file or directory murvai> /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/leda_graph.hpp:35: murvai> LEDA/node_map.h: No such murvai> file or directory For the Stanford GraphBase(SGB) stuff to work you must have Stanford GraphBase installed. If you don't already use SGB graphs then don't worry about it. murvai> murvai> When I compiled g++ -ftemplate-depth-30 -I /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/ stanford_graph_cc.cpp murvai> I got: murvai> In file included from stanford_graph_cc.cpp:27: murvai> /net/cooler/vol/export/proteome/murvai/CC/BOOST/boost_1_26_0/boost/graph/stanford_graph.hpp:54: murvai> gb_graph.h: No such file murvai> or Cheers, Jeremy ---------------------------------------------------------------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ----------------------------------------------------------------------
On Fri, 14 Dec 2001, Janos Murvai wrote: murvai> My plan to use your graph library intesively on larger graphs murvai> because your approach is very good :). Therefore I test the programs first Thanks! murvai> and report it if I find bug or just I don't know something. Thank you your murvai> help. Great. Yes, please keep reporting any bugs you find. (Hopefully there won't be too many!) Cheers, Jeremy ---------------------------------------------------------------------- Jeremy Siek http://php.indiana.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ----------------------------------------------------------------------
Hi Jeremy, Finally I found 13 possibly problems when I tested all example programs in libs/graph/example. When can I download the new version? Later I would like to use these libraries on some million edges and nodes. Thank you, Cheers, Janos On Fri, 14 Dec 2001, Jeremy Siek wrote:
On Fri, 14 Dec 2001, Janos Murvai wrote:
Finally I found 13 possibly problems when I tested all example programs in libs/graph/example.
Did your last email contain the complete list?
When can I download the new version?
It will take some time to go through the list. I don't know how long. I'll post an email concerning the resolution of each issue.
Later I would like to use these libraries on some million edges and nodes.
Sure. Cheers, Jeremy ---------------------------------------------------------------------- Jeremy Siek http://www.osl.iu.edu/~jsiek/ Ph.D. Student, Indiana Univ. B'ton email: jsiek@osl.iu.edu C++ Booster (http://www.boost.org) office phone: (812) 855-3608 ----------------------------------------------------------------------
Yes, I tested every programs (on simple way) in the example I found only those possibly bugs or errors. (I couldn't test few programs because those programs called read_graphviz where probably I would have built library before with jam. But I couldn't compiled jam..)
Thank you very much. Until I try to undestand the classes deeper, I just now study the templates.. Cheers, Janos
participants (2)
-
Janos Murvai -
Jeremy Siek