* Arthur Maciel <[email protected]> [130203 14:11]: > Oh, and just to add info from another language > > #include <iostream> > #include <boost/graph/adjacency_list.hpp> > > using namespace std; > using namespace boost; > > typedef adjacency_list<vecS, vecS, directedS> Graph; > > int main() > { > const int VERTEXES = 250000; > const int EDGES = 1000; > > Graph g(VERTEXES); > cout << " Boost Graph Library - Inserting edges" << endl; > > for (int i = 0; i < VERTEXES; ++i) > for (int j = 1; j < EDGES; ++j) > add_edge(i, j, g); > } > > $ g++ boost-example.cpp -o boost-example > $ time ./boost-example > > Boost Graph Library - Inserting edges > Killed > > real 2m10.779s > user 0m47.279s > sys 0m2.548s > > ------------------------------------------------------- > > I don't know if "Killed" is the same as a segfault.
This sounds like you are hitting a ulimit there... Cheers, Christian -- In the world, there is nothing more submissive and weak than water. Yet for attacking that which is hard and strong, nothing can surpass it. --- Lao Tzu _______________________________________________ Chicken-users mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/chicken-users
