igraph Reference Manual
igraph_subgraph_edges — Creates a subgraph with the specified edges
and their endpoints. .................................................................................... 551
30. Using BLAS, LAPACK and ARPACK for igraph matrices and graphs ........................... 552
BLAS interface in igraph ................................................................................... 552
igraph_blas_ddot — Dot product of two vectors. .................................... 552
igraph_blas_dgemv — Matrix-vector multiplication using BLAS, vector
version. .................................................................................................... 552
igraph_blas_dgemv_array — Matrix-vector multiplication using BLAS,
array version. ............................................................................................ 553
LAPACK interface in igraph .............................................................................. 553
Matrix factorization, solving linear systems .................................................... 554
Eigenvalues and eigenvectors of matrices ....................................................... 555
ARPACK interface in igraph .............................................................................. 560
Data structures .......................................................................................... 560
ARPACK solvers ....................................................................................... 566
31. Bipartite, i.e. two-mode graphs ............................................................................... 569
Bipartite networks in igraph ............................................................................... 569
Create two-mode networks .................................................................................. 569
igraph_create_bipartite — Create a bipartite graph. ........................... 569
igraph_full_bipartite — Create a full bipartite network. ...................... 570
igraph_bipartite_game — Generate a bipartite random graph (similar to
Erd#s-Rényi). ............................................................................................ 570
Incidence matrices .............................................................................................. 571
igraph_incidence — Creates a bipartite graph from an incidence matrix. ...... 571
igraph_get_incidence — Convert a bipartite graph into an incidence ma-
trix. ......................................................................................................... 572
Project two-mode graphs ..................................................................................... 573
igraph_bipartite_projection_size — Calculate the number of ver-
tices and edges in the bipartite projections. ..................................................... 573
igraph_bipartite_projection — Create one or both projections of a bi-
partite (two-mode) network. ......................................................................... 574
Other operations on bipartite graphs ...................................................................... 575
igraph_is_bipartite — Check whether a graph is bipartite. ..................... 575
32. Advanced igraph programming ............................................................................... 576
Using igraph in multi-threaded programs ............................................................... 576
IGRAPH_THREAD_SAFE — Specifies whether igraph was built in thread-safe
mode. ....................................................................................................... 576
Thread-safe ARPACK library ...................................................................... 576
Thread-safety of random number generators ................................................... 576
Progress handlers ............................................................................................... 576
About progress handlers ............................................................................. 576
Setting up progress handlers ........................................................................ 577
Invoking the progress handler ...................................................................... 578
Writing progress handlers ........................................................................... 579
Writing igraph functions with progress reporting ............................................ 580
Multi-threaded programs ............................................................................ 580
Status handlers .................................................................................................. 580
Status reporting ........................................................................................ 580
Setting up status handlers ............................................................................ 580
Invoking the status handler .......................................................................... 581
33. Non-graph related functions .................................................................................... 584
igraph version number ........................................................................................ 584
igraph_version — Return the version of the igraph C library ...................... 584
Running mean of a time series ............................................................................. 584
igraph_running_mean — Calculates the running mean of a vector. .............. 584
Random sampling from very long sequences .......................................................... 585
igraph_random_sample — Generates an increasing random sequence of in-
tegers. ...................................................................................................... 585
xx