![](https://csdnimg.cn/release/download_crawler_static/9010099/bg12.jpg)
igraph Reference Manual
xviii
igraph_disjoint_union_many — The disjint union of many graphs. .............. 486
igraph_union — Calculates the union of two graphs. ........................................ 487
igraph_union_many — Creates the union of many graphs. ............................... 488
igraph_intersection — Collect the common edges from two graphs. .............. 488
igraph_intersection_many — The intersection of more than two graphs. ........ 489
Other set-like operators ............................................................................................. 490
igraph_difference — Calculate the difference of two graphs .......................... 490
igraph_complementer — Create the complementer of a graph ......................... 491
igraph_compose — Calculates the composition of two graphs ............................ 491
27. Using BLAS, LAPACK and ARPACK for igraph matrices and graphs ................................. 493
BLAS interface in igraph ......................................................................................... 493
igraph_blas_dgemv — Matrix-vector multiplication using BLAS, vector ver-
sion. .............................................................................................................. 493
igraph_blas_dgemv_array — Matrix-vector multiplication using BLAS, array
version. .......................................................................................................... 494
LAPACK interface in igraph .................................................................................... 494
Matrix factorization, solving linear systems .......................................................... 494
Eigenvalues and eigenvectors of matrices ............................................................. 496
ARPACK interface in igraph .................................................................................... 501
Data structures ................................................................................................ 501
ARPACK solvers ............................................................................................. 507
28. Bipartite, i.e. two-mode graphs ..................................................................................... 510
Bipartite networks in igraph ..................................................................................... 510
Create two-mode networks ........................................................................................ 510
igraph_create_bipartite — Create a bipartite graph .................................. 510
igraph_full_bipartite — Create a full bipartite network ............................. 511
igraph_bipartite_game — Generate a bipartite random graph (similar to Er-
dos-Renyi) ...................................................................................................... 511
Incidence matrices ................................................................................................... 513
igraph_incidence — Create a bipartite graph from an incidence matrix .............. 513
igraph_get_incidence — Convert a bipartite graph into an incidence matrix ..... 513
Project a two-mode graphs ........................................................................................ 514
igraph_bipartite_projection_size — Calculate the number of vertices
and edges in the bipartite projections ................................................................... 514
igraph_bipartite_projection — Create one or both projections of a bipar-
tite (two-mode) network .................................................................................... 515
Other operations on bipartite graphs ............................................................................ 516
igraph_is_bipartite — Check whether a graph is bipartite ........................... 516
29. Advanced igraph programming ..................................................................................... 518
Using igraph in multi-threaded programs ..................................................................... 518
IGRAPH_THREAD_SAFE — Macro that is defined to be 1 if the current build of
the ................................................................................................................. 518
Thread-safe ARPACK library ............................................................................ 518
Progress handlers ..................................................................................................... 518
About progress handlers ................................................................................... 518
Setting up progress handlers .............................................................................. 518
Invoking the progress handler ............................................................................ 520
Writing progress handlers ................................................................................. 521
Writing igraph functions with progress reporting .................................................. 522
Multi-threaded programs .................................................................................. 522
Status handlers ........................................................................................................ 522
Status reporting .............................................................................................. 522
Setting up status handlers .................................................................................. 522
Invoking the status handler ................................................................................ 523