[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Compilation Issue Using Graph Generation
From: |
Thomas Gorochowski |
Subject: |
Re: [igraph] Compilation Issue Using Graph Generation |
Date: |
Thu, 30 Jul 2009 14:11:00 +0100 |
Hi
I am using igraph-0.5.2 which I compiled from source in the standard
way, only altered the prefix location to my development area. My
system is running Leopard 10.5.7 and compilation of my own code is
done using XCode. I am not 100% sure of the exact commands that XCode
uses but I have managed to recreate the problem using the following
program and compilation command from the terminal. If I use g++
instead of gcc it compiles fine. I'm sure it is probably the way I
have created the static library but some direction would be great.
C CODE ===========================
#include <stdlib.h>
#include <igraph.h>
int main (int argc, const char * argv[])
{
igraph_t *G;
G = (igraph_t *)malloc(sizeof(igraph_t));
igraph_erdos_renyi_game(G, IGRAPH_ERDOS_RENYI_GNM, 100, 400,
IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS);
return 0;
}
COMPILE COMMAND ===========================
gcc -I ~/Work/Complexity/Development/libs/include/igraph/ -L ~/Work/
Complexity/Development/libs/lib/libigraph.a test.c
Many thanks,
Tom
--
T.E. Gorochowski
University of Bristol, Centre for Complexity Sciences (BCCS)
http://www.chofski.co.uk, address@hidden
From:
Gábor Csárdi
Subject:
Re: [igraph] Compilation Issue Using Graph Generation
Date:
Wed, 29 Jul 2009 21:39:41 +0200
Tom, this should not happen. igraph indeed contains some C++ code,
but after you have compiled igraph (with a C and a C++ compiler) you
can happily write your programs in C. How did you install igraph?
What version do you have? How did compile your own program? Can you
send a small program that reproduces the error? Thanks, Gabor On
Wed, Jul 29, 2009 at 6:03 PM, Thomas Gorochowski<address@hidden>
wrote: > Hi there, > > I am experiencing some problems compiling a
program I am writing that uses > igraph. Previously the program was
compiling successfully, however, after > adding the following line I
get the linker errors documented at the end of > this e-mail. > >
igraph_erdos_renyi_game(G, IGRAPH_ERDOS_RENYI_GNM, 100, 500, >
IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS); > > It looks like it is trying
to use some C++ symbols, however, I was under the > impression that
igraph was a pure C implementation? Is there a way of > linking to
igraph so that any underlying C++ code is hidden and not required >
by the linker? > > The reason for this requirement is that I am
developing a Mac OS X > application on top of this library and from
experience it plays better with > just C based code. > > Many
thanks, > > Tom > -- > T.E. Gorochowski > University of Bristol,
Centre for Complexity Sciences (BCCS) > http://www.chofski.co.uk,
address@hidden > > > ***************** Linker Output
******************* > Undefined symbols: > "operator delete[]
(void*)", referenced from: > _igraph_degree_sequence_game_vl in
> libigraph.a(libigraph_la-gengraph_mr-connected.o) >
gengraph::graph_molloy_opt::breadth_search(int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::~graph_molloy_opt()in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::~graph_molloy_opt()in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::replace(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::clean() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::is_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::is_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertices_real(int&) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::pick_random_vertices(int&, int*, int, >
int*)in libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o)
> gengraph::graph_molloy_opt::pick_random_dst(double, int*,
int*, int, > int*)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::pick_random_src(double, int*, int*, int,
> int*)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::graph_molloy_opt(__sFILE*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::make_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::make_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::make_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::make_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::components(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::components(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::nbarcs_comp() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::nbvertices_comp() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::giant_comp() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::try_disconnect(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::try_disconnect(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::fab_connected_shuffle(long) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::opt_fab_connected_shuffle(long) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::gkantsidis_connected_shuffle(long) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::sort_vertices(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_hash::~graph_molloy_hash()in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::~graph_molloy_hash()in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::is_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::is_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::restore(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::try_shuffle(int, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::try_shuffle(int, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::try_shuffle(int, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::optimal_window() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::shuffle(unsigned long, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::shuffle(unsigned long, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::depth_isolated(int, long&, int&, int, >
int*&, bool*)in libigraph.a(libigraph_la-
gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::effective_K(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::effective_K(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::degree_sequence::~degree_sequence()in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::cumul_sort(int*, int)in > libigraph.a(libigraph_la-
gengraph_degree_sequence.o) >
gengraph::degree_sequence::print_cumul() in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::box_list::~box_list()in > libigraph.a(libigraph_la-
gengraph_box_list.o) > gengraph::box_list::~box_list()in >
libigraph.a(libigraph_la-gengraph_box_list.o) >
gengraph::box_list::~box_list()in > libigraph.a(libigraph_la-
gengraph_box_list.o) > gengraph::powerlaw::~powerlaw()in >
libigraph.a(libigraph_la-gengraph_powerlaw.o) >
gengraph::powerlaw::~powerlaw()in > libigraph.a(libigraph_la-
gengraph_powerlaw.o) >
gengraph::powerlaw::init_to_offset(double, int)in >
libigraph.a(libigraph_la-gengraph_powerlaw.o) > "operator
delete(void*)", referenced from: >
_igraph_degree_sequence_game_vl in > libigraph.a(libigraph_la-
gengraph_mr-connected.o) > _igraph_degree_sequence_game_vl in >
libigraph.a(libigraph_la-gengraph_mr-connected.o) >
_igraph_degree_sequence_game_vl in > libigraph.a(libigraph_la-
gengraph_mr-connected.o) > _igraph_degree_sequence_game_vl in >
libigraph.a(libigraph_la-gengraph_mr-connected.o) >
_igraph_degree_sequence_game_vl in > libigraph.a(libigraph_la-
gengraph_mr-connected.o) > _igraph_degree_sequence_game_vl in >
libigraph.a(libigraph_la-gengraph_mr-connected.o) >
_igraph_degree_sequence_game_vl in > libigraph.a(libigraph_la-
gengraph_mr-connected.o) >
gengraph::degree_sequence::degree_sequence(__sFILE*, bool)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(__sFILE*, bool)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(__sFILE*, bool)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(__sFILE*, bool)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
std::vector<int, std::allocator<int>
>>::_M_insert_aux(__gnu_cxx::__normal_iterator<int*,
std::vector<int, > std::allocator<int> > >, int const&)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) > "operator
new[](unsigned long)", referenced from: >
gengraph::graph_molloy_opt::breadth_search(int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::backup(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::hard_copy() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::backup_degs(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::replace(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::is_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::is_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertices_real(int&) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::pick_random_vertices(int&, int*, int, >
int*)in libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o)
> gengraph::graph_molloy_opt::path_sampling(int*, int*, double*,
> double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::path_sampling(int*, int*, double*, >
double**)in libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::rho(int, int, int*, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::vertex_betweenness(int, bool)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::alloc(gengraph::degree_sequence&)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::alloc(gengraph::degree_sequence&)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::vertex_cover(int, int*, int*, int**)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::traceroute_sample(int, int, int*, int,
int*, > double*, double**)in > libigraph.a(libigraph_la-
gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::graph_molloy_opt(__sFILE*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::graph_molloy_opt(__sFILE*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::make_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::make_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::components(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::components(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::components(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::try_disconnect(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::try_disconnect(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::sort_vertices(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_opt::sort_vertices(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
gengraph::graph_molloy_hash::is_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::is_connected() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::alloc(gengraph::degree_sequence&)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::alloc(gengraph::degree_sequence&)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::hard_copy() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::backup() in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::restore(int*) in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::try_shuffle(int, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::try_shuffle(int, int, int*)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::shuffle(unsigned long, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::shuffle(unsigned long, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::shuffle(unsigned long, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::depth_isolated(int, long&, int&, int, >
int*&, bool*)in libigraph.a(libigraph_la-
gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::effective_K(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::graph_molloy_hash::effective_K(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_hash.o) >
gengraph::cumul_sort(int*, int)in > libigraph.a(libigraph_la-
gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(igraph_vector_t const*)in
> libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::print_cumul() in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::havelhakimi() in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(int, double, int, int, >
double)in libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(int, double, int, int, >
double)in libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(__sFILE*, bool)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(__sFILE*, bool)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::degree_sequence::degree_sequence(__sFILE*, bool)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
gengraph::box_list::box_list(int, int*)in > libigraph.a(libigraph_la-
gengraph_box_list.o) > gengraph::box_list::box_list(int, int*)in
> libigraph.a(libigraph_la-gengraph_box_list.o) >
gengraph::box_list::box_list(int, int*)in > libigraph.a(libigraph_la-
gengraph_box_list.o) > gengraph::powerlaw::powerlaw(double, int,
int)in > libigraph.a(libigraph_la-gengraph_powerlaw.o) >
gengraph::powerlaw::powerlaw(double, int, int)in >
libigraph.a(libigraph_la-gengraph_powerlaw.o) >
gengraph::powerlaw::init_to_offset(double, int)in >
libigraph.a(libigraph_la-gengraph_powerlaw.o) > "operator
new(unsigned long)", referenced from: >
_igraph_degree_sequence_game_vl in > libigraph.a(libigraph_la-
gengraph_mr-connected.o) > _igraph_degree_sequence_game_vl in >
libigraph.a(libigraph_la-gengraph_mr-connected.o) >
_igraph_degree_sequence_game_vl in > libigraph.a(libigraph_la-
gengraph_mr-connected.o) > std::vector<int, std::allocator<int>
>>::_M_insert_aux(__gnu_cxx::__normal_iterator<int*,
std::vector<int, > std::allocator<int> > >, int const&)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
"std::__throw_length_error(char const*)", referenced from: >
std::vector<int, std::allocator<int>
>>::_M_insert_aux(__gnu_cxx::__normal_iterator<int*,
std::vector<int, > std::allocator<int> > >, int const&)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
"___gxx_personality_v0", referenced from: >
___gxx_personality_v0$non_lazy_ptr in > libigraph.a(libigraph_la-
gengraph_mr-connected.o) > ___gxx_personality_v0$non_lazy_ptr in
> libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
___gxx_personality_v0$non_lazy_ptr in > libigraph.a(libigraph_la-
gengraph_graph_molloy_hash.o) >
___gxx_personality_v0$non_lazy_ptr in > libigraph.a(libigraph_la-
gengraph_degree_sequence.o) > ___gxx_personality_v0$non_lazy_ptr
in > libigraph.a(libigraph_la-gengraph_box_list.o) >
___gxx_personality_v0$non_lazy_ptr in > libigraph.a(libigraph_la-
gengraph_powerlaw.o) > "std::__throw_bad_alloc()", referenced from:
> std::vector<int, std::allocator<int>
>>::_M_insert_aux(__gnu_cxx::__normal_iterator<int*,
std::vector<int, > std::allocator<int> > >, int const&)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
"std::ios_base::Init::Init()", referenced from: >
__static_initialization_and_destruction_0(int, int)in >
libigraph.a(libigraph_la-gengraph_mr-connected.o) >
__static_initialization_and_destruction_0(int, int)in >
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
__static_initialization_and_destruction_0(int, int)in >
libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
"std::ios_base::Init::~Init()", referenced from: > ___tcf_0 in
libigraph.a(libigraph_la-gengraph_mr-connected.o) > ___tcf_0 in
libigraph.a(libigraph_la-gengraph_graph_molloy_optimized.o) >
___tcf_0 in libigraph.a(libigraph_la-gengraph_degree_sequence.o) >
ld: symbol(s) not found > collect2: ld returned 1 exit status > > >
> > _______________________________________________ > igraph-help
mailing list > address@hidden > http://lists.nongnu.org/mailman/listinfo/igraph-help
> -- Gabor Csardi <address@hidden> UNIL DGM